Web3 technologies, representing the next generation of a decentralised and user-centric Internet, offer innovative solutions to enhance adaptability, sustainability, and resilience in logistics systems aligned with the principles of Logistics 5.0. This study conducts a Systematic Literature Review (SLR) following the Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) methodology, analysing peer-reviewed journal articles published between 2018 and 2024 and retrieved from Scopus, Web of Science Core Collection, IEEE Xplore, and ACM Digital Library. The review specifically focuses on trucking logistics, a sector characterised by high fossil-fuel dependency, operational fragmentation, and significant environmental impact. The findings reveal that Artificial Intelligence and Internet of Things technologies dominate current implementations, mainly supporting fleet management, route optimisation, accident prevention, and risk assessment. In contrast, blockchain applications remain limited, and metaverse-based solutions are largely exploratory and confined to training scenarios. Key research gaps include the scarcity of integrated Web3 solutions, the limited consideration of human-centric Logistics 5.0 dimensions, and the lack of large-scale empirical validation in real-world trucking operations. Based on the analysis, this paper proposes a conceptual framework that maps Web3 technologies to trucking logistics areas, investment priorities, and Logistics 5.0 objectives, offering actionable guidance for Logistics Service Providers transitioning from Logistics 4.0 to Logistics 5.0.
The Hamiltonian cycle problem is a well-known NP-complete problem in graph theory. This problem relates to lots of practical problems such as designing very large scale integration (VLSI) and travel-ling salesman problem (TSP). Since it is NP-complete, there is no efficient algorithm to solve the Hamiltonian cycle problem, and hence, its solution is valuable. In this paper, we propose new physical zero-knowledge proof protocols for the Hamiltonian cycle problem, whereby an entity can prove its knowledge of a solution to another entity without leaking any information about the valuable solution. Our protocols are more efficient than the previous protocols. We also propose a physical zero-knowledge proof protocol for TSP, one of whose building blocks is a new representation of an integer commitment with a secure addition protocol.
Objective. To develop, formalize, and evaluate a decentralized multi-agent system for realâtime traffic management in autonomous openâpit mining operations, aimed at minimizing truck idle time, preventing congestion and deadlocks, and increasing overall haulage efficiency. Methodology. The system is designed using a multiâagent paradigm where haul trucks, excavators,dumping points, and key infrastructure elements are modeled as autonomous agents. Task allocation is performed via a marketâbased Contract Net Protocol with bidding based on estimated time of arrival. Path planning employs an A* algorithm on a dynamic graph, while conflict resolution is achieved through a reservation mechanism managed by infrastructure agents. Reinforcement learning (Qâlearning) is integrated to allow truck agents to adapt their bidding strategies over time. The approach is validated through agentâbased simulations under normal, highâintensity, and disruption scenarios, and compared against a centralized firstâcome, firstâserved dispatch system. Results. Under normal operation, the multiâagent system reduced average truck idle time by 44%, cycle time by 17.5%, increased throughput by 21%, and lowered traffic conflict frequency by 66.5% compared to the baseline. In highâintensity traffic, it prevented congestion and deadlocks, maintaining smooth flow. During unexpected disruptions (excavator breakdown, road blockage), the system autonomously reâplanned routes and reassigned tasks within minutes, effectively isolating the impact and ensuring operational continuity. Scientific novelty. The novelty lies in the holistic integration of decentralized coordination, marketâbased task allocation, dynamic path reservation, and reinforcement learning within a unified multiâagent framework for realâtime traffic management in openâpit mining. This approach enables emergent selfâorganization, robust adaptation to dynamic conditions, and scalability beyond the capabilities of traditional centralized fleet management systems. Practical significance. The proposed system offers a scalable and resilient solution for autonomous haulage fleets, directly reducing operational costs through lower idle times and higher throughput, improving safety by preventing traffic conflicts, and enhancing resilience to equipment failures or route blockages. It provides a clear pathway for transitioning existing mines to fully autonomous, efficient, and safe operations. Keywords: multi-agent system, traffic management, open-pit mining, autonomous haulage, fleet management, reinforcement learning, Contract Net Protocol, path planning, conflict resolution, simulation.
The complexity of modern supply chain networks requires sophisticated approaches to inventory management that can effectively handle demand uncertainty and coordinate decisions across multiple organizational levels. This paper proposes a novel hierarchical multi-agent reinforcement learning framework for dynamic inventory allocation in multi-echelon supply chains facing stochastic demand patterns. The hierarchical architecture decomposes the inventory control problem into strategic and operational decision layers, where high-level agents coordinate allocation policies across distribution networks while low-level agents optimize local replenishment decisions. The framework integrates Centralized Training with Decentralized Execution paradigm, enabling autonomous agents to learn coordinated policies through shared experience while maintaining operational independence during deployment. Experimental results demonstrate that the proposed approach achieves significant reductions in total system costs compared to traditional base-stock policies and single-agent reinforcement learning methods, while effectively mitigating the bullwhip effect in supply chains with high demand variability.
This research proposes the development of a next generation airline reservation system that incorporates the Cloud microservices, distributed artificial intelligence modules and the blockchain technology to improve on the efficiency, safety and customer satisfaction. The traditional reservation systems encounter issues related to the expansion of the systems, the integrity of the data provided and the level of service offered to the customers, which is the main focus of this architecture through the modular and data centric design approaches. This will allow different operations such as reservations, payments, and customer data management among others to be performed separately thereby facilitating high availability of the system by 30% and enhancing performance of the system by 40% on its scalability. Such systems contain AI driven modules that utilize the past booking patterns along with the profile of the customer to estimate the demand and make recommendations, which increases to 25 % of customer engagement. Moreover, blockchain is effective in engaging an incorruptible ledger system for the all transactions therefore mitigating fraud incidences and increasing the clarity by 20%. The system was subjected to analysis using a simulator and using machine learning evaluations that rated it against other conventional systems. The results show that there were clear enhancements in the speed of transactions where the rates of secure data processing rose by 35%, and the system response time by 15 %. The system can also be used for other high transaction industries like logistics and hospitality. This structural design is indicative of how the use of advanced technologies will revolutionize the airline reservation sector. The implications are growing effectiveness, improvement in security and greater customer contentment.
Abstract We address two interrelated issues affecting the hinterland portion of the maritime container supply chain: reducing the movement of empty containers and reducing empty trips by trucks carrying these containers. In this paper, we show that empty container flow optimization can be implemented via a blockchain based on the proofâofâusefulâwork concept where the proof of work requires the solution of an âhard optimization problem whose solution benefits the blockchain participants. Accordingly, we propose that anonymous miners compete to solve the container truck routing problem, which seeks to find the most efficient routes for trucks. We show that this problem is âhard. Miners must also solve the problem of optimally matching consignees and shippers, which will reduce transportation and storage costs for empty containers. In essence, the proposed framework turns blockchain into a massive optimization engine that directly benefits the hinterland container supply chain ecosystem.
Abstract Alongside the rise of âlast-mileâ delivery in contemporary urban logistics, drones have demonstrate commercial potential, given their outstanding triple-bottom-line performance. However, as a lithium-ion battery-powered device, dronesâ social and environmental merits can be overturned by battery recycling and disposal. To maintain economic performance, yet minimise environmental negatives, fleet sharing is widely applied in the transportation field, with the aim of creating synergies within industry and increasing overall fleet use. However, if a sharing platformâs transparency is doubted, the sharing ability of the platform will be discounted. Known for its transparent and secure merits, blockchain technology provides new opportunities to improve existing sharing solutions. In particular, the decentralised structure and data encryption algorithm offered by blockchain allow every participant equal access to shared resources without undermining security issues. Therefore, this study explores the implementation of a blockchain-enabled fleet sharing solution to optimise drone operations, with consideration of battery wear and disposal effects. Unlike classical vehicle routing with fleet sharing problems, this research is more challenging, with multiple objectives (i.e., shortest path and fewest charging times), and considers different levels of sharing abilities. In this study, we propose a mixed-integer programming model to formulate the intended problem and solve the problem with a tailored branch-and-price algorithm. Through extensive experiments, the computational performance of our proposed solution is first articulated, and then the effectiveness of using blockchain to improve overall optimisation is reflected, and a series of critical influential factors with managerial significance are demonstrated.
Previous article Next article Heuristic Methods for Location-Allocation ProblemsLeon CooperLeon Cooperhttps://doi.org/10.1137/1006005PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] Leon Cooper, Location-allocation problems, Operations Res., 11 (1963), 331â343, No. 3 MR0152365 0113.14201 CrossrefISIGoogle Scholar[2] Google Scholar[3] D. H. Lehmer, Teaching combinatorial tricks to a computerProc. Sympos. Appl. Math., Vol. 10, American Mathematical Society, Providence, R.I., 1960, 179â193, Combinatorial Analysis MR0113289 0096.00504 CrossrefGoogle Scholar[4] J. Heller, Some numerical experiments for an $M\times J$ flow shop and its decision-theoretical aspects, Operations Res., 8 (1960), 178â184, No. 2 MR0111626 0092.27910 CrossrefISIGoogle Scholar[5] J. Moshman, The Application of Sequential Estimation To Computer Simulation and Monte Carlo Procedures, J. Association for Computing Machinery, 5 (1958), 0086.11603 CrossrefISIGoogle Scholar[6] A. Wald, Sequential Analysis, John Wiley and Sons, New York, 1952 Google Scholar Previous article Next article FiguresRelatedReferencesCited ByDetails An elliptical cover problem in drone delivery network design and its solution algorithmsEuropean Journal of Operational Research, Vol. 304, No. 3 | 1 Feb 2023 Cross Ref Two lower-bounding algorithms for the p-center problem in an areaComputational Urban Science, Vol. 2, No. 1 | 24 January 2022 Cross Ref Optimal planar facility location with dense demands along a curveJournal of the Operational Research Society, Vol. 73, No. 8 | 8 May 2021 Cross Ref A continuous location and maintenance routing problem for offshore wind farms: Mathematical models and hybrid methodsComputers & Operations Research, Vol. 144 | 1 Aug 2022 Cross Ref Spatial autocorrelation informed approaches to solving locationâallocation problemsSpatial Statistics, Vol. 50 | 1 Aug 2022 Cross Ref Electric vehicle charging stations emplacement using genetic algorithms and agent-based simulationExpert Systems with Applications, Vol. 197 | 1 Jul 2022 Cross Ref Less is more: simple algorithms for the minimum sum of squares clustering problemIMA Journal of Management Mathematics, Vol. 33, No. 3 | 19 August 2021 Cross Ref Less is more: discrete starting solutions in the planar p-median problemTOP, Vol. 30, No. 1 | 6 April 2021 Cross Ref A two-level off-grid electric distribution problem on the continuous spaceComputers & Operations Research, Vol. 67 | 1 Apr 2022 Cross Ref Continuous Facility Location ProblemsThe Palgrave Handbook of Operations Research | 8 July 2022 Cross Ref The New Era of Hybridisation and Learning in Heuristic Search DesignThe Palgrave Handbook of Operations Research | 8 July 2022 Cross Ref Less Is More Approach in Heuristic OptimizationThe Palgrave Handbook of Operations Research | 8 July 2022 Cross Ref Formulation Space Search MetaheuristicThe Palgrave Handbook of Operations Research | 8 July 2022 Cross Ref Surface ozone monitoring and policy: A geospatial decision support tool for suitable location of monitoring stations in urban areasEnvironmental Science & Policy, Vol. 126 | 1 Dec 2021 Cross Ref Articulating Spatial Statistics and Spatial Optimization Relationships: Expanding the Relevance of StatisticsStats, Vol. 4, No. 4 | 19 October 2021 Cross Ref Discrete Facility Location in Machine LearningJournal of Applied and Industrial Mathematics, Vol. 15, No. 4 | 10 July 2022 Cross Ref Teaching SpreadsheetâBased Analysis of Multisource Continuous Facility Location ProblemsDecision Sciences Journal of Innovative Education | 9 August 2021 Cross Ref A matheuristic for the stochastic facility location problemJournal of Heuristics, Vol. 27, No. 4 | 26 February 2021 Cross Ref Edge computing server placement with capacitated location allocationJournal of Parallel and Distributed Computing, Vol. 153 | 1 Jul 2021 Cross Ref Evaluation of heuristics for the p-median problem: Scale and spatial demand distributionComputers, Environment and Urban Systems, Vol. 88 | 1 Jul 2021 Cross Ref Self-Configuring (1 + 1)-Evolutionary Algorithm for the Continuous p-Median Problem with Agglomerative MutationAlgorithms, Vol. 14, No. 5 | 22 April 2021 Cross Ref Complex Energy Networks Optimization: Part IâDevelopment and Validation of a Software for Optimal Load AllocationJournal of Engineering for Gas Turbines and Power, Vol. 143, No. 4 | 22 February 2021 Cross Ref Fiber to the Home (FTTH) Automation Planning, Its Impact on Customer Satisfaction & Cost-EffectivenessWireless Personal Communications, Vol. 117, No. 2 | 24 November 2020 Cross Ref Heuristic-Based Location Allocation of Single Frequency Network StationsIEEE Transactions on Broadcasting, Vol. 67, No. 1 | 1 Mar 2021 Cross Ref Multi-objective solid transportation-location problem with variable carbon emission in inventory management: a hybrid approachAnnals of Operations Research, Vol. 41 | 5 February 2021 Cross Ref Optimized Supply Chain Management of Rice in South Korea: LocationâAllocation Model of Rice ProductionAgronomy, Vol. 11, No. 2 | 31 January 2021 Cross Ref When closest is not always the best: The distributed p-median problemJournal of the Operational Research Society, Vol. 72, No. 1 | 12 December 2019 Cross Ref Particle Swarm Optimization and Grey Wolf Optimizer to Solve Continuous p-Median Location ProblemsMachine Learning and Big Data Analytics Paradigms: Analysis, Applications and Challenges | 15 December 2020 Cross Ref Location and capacity decisions for electric bus charging stations considering waiting timesTransportation Research Part D: Transport and Environment, Vol. 90 | 1 Jan 2021 Cross Ref APPROPRIATE ALLOCATIONS AND LOCATIONS ANALYSIS OF INCINERATION FACILITIES BY MULTI-OBJECTIVE OPTIMIZATION USING VORONOI DIAGRAM AND GENETIC ALGORITHM: A CASE STUDY OF THE NORTHWESTERN BAY AREA IN CHIBA PREFECTURETransactions of the Operations Research Society of Japan, Vol. 64, No. 0 | 1 Jan 2021 Cross Ref Directional approach to gradual cover: the continuous caseComputational Management Science, Vol. 18, No. 1 | 18 October 2020 Cross Ref An Approximation Approach for Fixed-Charge Transportation-p-Facility Location ProblemLogistics and Supply Chain Management | 30 October 2021 Cross Ref Self-Adjusting Variable Neighborhood Search Algorithm for Near-Optimal k-Means ClusteringComputation, Vol. 8, No. 4 | 5 November 2020 Cross Ref K-Means Genetic Algorithms with Greedy Genetic OperatorsMathematical Problems in Engineering, Vol. 2020 | 27 Nov 2020 Cross Ref On the convergence of the Cooperâs algorithmOptimization Letters, Vol. 14, No. 8 | 23 March 2020 Cross Ref The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methodsJournal of Global Optimization, Vol. 78, No. 2 | 6 December 2019 Cross Ref An exact and a heuristic approach for the transportation-p-facility location problemComputational Management Science, Vol. 17, No. 3 | 30 January 2020 Cross Ref Heuristic approaches for solid transportation-p-facility location problemCentral European Journal of Operations Research, Vol. 28, No. 3 | 28 January 2019 Cross Ref A voltage drop limited decentralized electric power distribution networkComputers & Operations Research, Vol. 118 | 1 Jun 2020 Cross Ref ReferencesLocationâbased Marketing | 17 April 2020 Cross Ref An ADMM-based locationâallocation algorithm for nonconvex constrained multi-source Weber problem under gaugeJournal of Global Optimization, Vol. 76, No. 4 | 11 June 2019 Cross Ref The blockwise coordinate descent method for integer programsMathematical Methods of Operations Research, Vol. 91, No. 2 | 15 June 2019 Cross Ref Biologically Inspired Parent Selection in Genetic AlgorithmsAnnals of Operations Research, Vol. 287, No. 1 | 22 July 2019 Cross Ref Accelerated hyperbolic smoothing method for solving the multisource FermatâWeber and k-Median problemsKnowledge-Based Systems, Vol. 191 | 1 Mar 2020 Cross Ref Scaling up an Edge Server Deployment2020 IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops) | 1 Mar 2020 Cross Ref Classical and Inverse Median Location Problems under Uncertain EnvironmentActa Mathematicae Applicatae Sinica, English Series, Vol. 36, No. 2 | 11 April 2020 Cross Ref 2020 Cross Ref Multi-facility green Weber problemComputers & Operations Research, Vol. 113 | 1 Jan 2020 Cross Ref A Spatial Optimization Approach for Solving a Multi-facility Location Problem with Continuously Distributed DemandInnovations in Urban and Regional Systems | 12 May 2020 Cross Ref Optimizing Field Productivity by Mobile Warehouse Deployment Using Evolutionary Algorithms2019 IEEE Symposium Series on Computational Intelligence (SSCI) | 1 Dec 2019 Cross Ref Hub relay network design for daily driver routesInternational Journal of Production Research, Vol. 57, No. 19 | 12 February 2019 Cross Ref Revised Weighted Fuzzy C-Means and Fortified Weiszfeld Hybrid Method for Uncapacitated Multi-Facility Location ProblemsInternational Journal of Operations Research and Information Systems, Vol. 10, No. 4 | 1 Oct 2019 Cross Ref Solving multiple facilities location problems with separated clustersOperations Research Letters, Vol. 47, No. 5 | 1 Sep 2019 Cross Ref A Benders Decomposition Method for Designing Reliable Supply Chain Networks Accounting for Multimitigation Strategies and Demand LossesTransportation Science, Vol. 53, No. 5 | 1 Sep 2019 Cross Ref Spatial optimization for land acquisition problems: A review of models, solution methods, and GIS supportTransactions in GIS, Vol. 16 | 6 June 2019 Cross Ref Uncertain multi-objective multi-commodity multi-period multi-vehicle location-allocation model for earthquake evacuation planningApplied Mathematics and Computation, Vol. 350 | 1 Jun 2019 Cross Ref The location-allocation problem of drone base stationsComputers & Operations Research | 1 Jun 2019 Cross Ref Optimizing the spatial relocation of hospitals to reduce urban traffic congestion: A case study of BeijingTransactions in GIS, Vol. 23, No. 2 | 1 April 2019 Cross Ref The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problemAnnals of Operations Research, Vol. 275, No. 2 | 23 August 2018 Cross Ref A directional approach to gradual coverTOP, Vol. 27, No. 1 | 15 November 2018 Cross Ref The Optimal Solution Set of the Multi-source Weber ProblemBulletin of the Iranian Mathematical Society, Vol. 45, No. 2 | 12 July 2018 Cross Ref Give-And-Take heuristic model to political redistricting problemsSpatial Information Research, Vol. 5 | 2 March 2019 Cross Ref Crowdsourcing planar facility location allocation problemsComputing, Vol. 101, No. 3 | 20 October 2018 Cross Ref The planar multifacility collection depots location problemComputers & Operations Research, Vol. 102 | 1 Feb 2019 Cross Ref Mathematical modelling and heuristic approaches to the location-routing problem of a cost-effective integrated solid waste managementAnnals of Operations Research, Vol. 273, No. 1-2 | 4 June 2018 Cross Ref Optimization of competitive facility location for chain storesAnnals of Operations Research, Vol. 273, No. 1-2 | 15 July 2017 Cross Ref Optimal solutions for the continuous p -centre problem and related -neighbour and conditional problems: A relaxation-based algorithmJournal of the Operational Research Society, Vol. 70, No. 2 | 19 January 2018 Cross Ref Introduction: The Practice of Spatial AnalysisThe Practice of Spatial Analysis | 29 June 2018 Cross Ref 2019 Cross Ref 2019 Cross Ref 2019 Cross Ref 2019 Cross Ref Understanding the Weber Location ParadigmContributions to Location Analysis | 8 October 2019 Cross Ref Locating Dimensional Facilities in a Continuous SpaceLocation Science | 17 March 2020 Cross Ref An algorithm for generalized constrained multi-source Weber problem with demand substations4OR, Vol. 16, No. 4 | 2 December 2017 Cross Ref The Weber obnoxious facility location model: A Big Arc Small Arc approachComputers & Operations Research, Vol. 98 | 1 Oct 2018 Cross Ref MIP model for efficient dimensioning of real-world FTTH treesTelecommunication Systems, Vol. 68, No. 2 | 27 September 2017 Cross Ref Classifiers Applied to Dimensioning of Splitters in PON DesignJournal of Optical Communications and Networking, Vol. 10, No. 6 | 21 May 2018 Cross Ref Optimal number and location of storage hubs and biogas production reactors in farmlands with allocation of multiple feedstocksApplied Mathematical Modelling, Vol. 55 | 1 Mar 2018 Cross Ref Considering Diversity in Spatial Decision Support SystemsGeoComputational Analysis and Modeling of Regional Systems | 31 July 2017 Cross Ref Spatial Autocorrelation and the p-Median ProblemMorphisms for Quantitative Spatial Analysis | 8 March 2018 Cross Ref Location Modeling and Covering MetricsLocation Covering Models | 23 December 2018 Cross Ref Vers un merchandising multi-agentsRetailing et localisation | 1 Jan 2018 Cross Ref A distance-limited continuous location-allocation problem for spatial planning of decentralized systemsComputers & Operations Research, Vol. 88 | 1 Dec 2017 Cross Ref A Two-echelon joint continuous-discrete location modelEuropean Journal of Operational Research, Vol. 262, No. 3 | 1 Nov 2017 Cross Ref Incorporating neighborhood reduction for the solution of the planar p-median problemAnnals of Operations Research, Vol. 258, No. 2 | 12 August 2015 Cross Ref The continuous single source location problem with capacity and zone-dependent fixed cost: Models and solution approachesEuropean Journal of Operational Research, Vol. 263, No. 1 | 1 Nov 2017 Cross Ref The capacitated multi-facility weber problem with polyhedral barriers: Efficient heuristic methodsComputers & Industrial Engineering, Vol. 113 | 1 Nov 2017 Cross Ref Transportation-location problem with unknown number of facilitiesComputers & Industrial Engineering, Vol. 112 | 1 Oct 2017 Cross Ref Non-myopic relocation of idle mobility-on-demand vehicles as a dynamic location-allocation-queueing problemTransportation Research Part E: Logistics and Transportation Review, Vol. 106 | 1 Oct 2017 Cross Ref A versatile adaptive aggregation framework for spatially large discrete location-allocation problemsComputers & Industrial Engineering, Vol. 111 | 1 Sep 2017 Cross Ref On Strategies to Fix Degenerate k-means SolutionsJournal of Classification, Vol. 34, No. 2 | 10 June 2017 Cross Ref Speeding up the optimal method of Drezner for the p -centre problem in the planeEuropean Journal of Operational Research, Vol. 257, No. 3 | 1 Mar 2017 Cross Ref 2-Facility manifold location routing problemOptimization Letters, Vol. 11, No. 2 | 26 December 2015 Cross Ref Location Planning and Network DesignComputational Intelligence in Logistics and Supply Chain Management | 28 July 2016 Cross Ref Hybridisation SearchHeuristic Search | 21 February 2017 Cross Ref Bringing infrastructure into pricing in road freight transportation â A measuring concept based on navigation service dataTransportation Research Procedia, Vol. 25 | 1 Jan 2017 Cross Ref A Genetic Algorithm to Solve the Optimum Location Problem for Surveillance SensorsJournal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography, Vol. 34, No. 6 | 31 Dec 2016 Cross Ref Mixed planar and network single-facility location problemsNetworks, Vol. 68, No. 4 | 18 August 2016 Cross Ref Sequential location of two facilities: comparing random to optimal location of the first facilityAnnals of Operations Research, Vol. 246, No. 1-2 | 19 August 2014 Cross Ref New local searches for solving the multi-source Weber problemAnnals of Operations Research, Vol. 246, No. 1-2 | 5 February 2015 Cross Ref An adaptive perturbation-based heuristic: An application to the continuous p-centre problemComputers & Operations Research, Vol. 75 | 1 Nov 2016 Cross Ref Insights into the effect of traffic congestion on distribution network characteristics â a numerical analysis based on navigation service dataInternational Journal of Logistics Research and Applications, Vol. 19, No. 5 | 13 November 2015 Cross Ref Modeling and solving a capacitated stochastic location-allocation problem using sub-sourcesSoft Computing, Vol. 20, No. 6 | 17 March 2015 Cross Ref A minisum location problem with regional demand considering farthest Euclidean distancesOptimization Methods and Software, Vol. 31, No. 3 | 23 December 2015 Cross Ref Hybrid self-adaptive-velocity particle swarm optimisation-Cooper heuristic for the facility location allocation problem in JakartaInternational Journal of Systems Science: Operations & Logistics, Vol. 3, No. 2 | 14 April 2015 Cross Ref Planning the City Logistics Terminal Location by Applying the Green p -Median Model and Type-2 Neurofuzzy NetworkComputational Intelligence and Neuroscience, Vol. 2016 | 1 Jan 2016 Cross Ref Manifold Location Routing Problem with Applications in Network TheoryModels, Algorithms and Technologies for Network Analysis | 21 October 2016 Cross Ref Prepositioning of Relief Items Under Uncertainty: A Classification of Modeling and Solution Approaches for Disaster ManagementLogistics Management | 9 August 2015 Cross Ref StandortmanagementStrategisches und operatives Logistikmanagement: Distribution | 15 October 2015 Cross Ref A locationâallocation problem with concentric circlesIIE Transactions, Vol. 47, No. 12 | 28 April 2015 Cross Ref Solving the planar p-median problem by variable neighborhood and concentric searchesJournal of Global Optimization, Vol. 63, No. 3 | 23 April 2014 Cross Ref A Parallel Algorithm for the Facility Location Problem Applied to Oil and Gas Logistics2015 International Symposium on Computer Architecture and High Performance Computing Workshop (SBAC-PADW) | 1 Oct 2015 Cross Ref A capacitated location-allocation problem with stochastic demands using sub-sources: An empirical studyApplied Soft Computing, Vol. 34 | 1 Sep 2015 Cross Ref A Heuristic for the Multisource Weber Problem with Service Level ConstraintsTransportation Science, Vol. 49, No. 3 | 1 Aug 2015 Cross Ref A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfacesComputational Management Science, Vol. 12, No. 3 | 23 December 2014 Cross Ref A Constructive Method and a Guided Hybrid GRASP for the Capacitated Multi-Source Weber Problem in the Presence of Fixed CostJournal of Algorithms & Computational Technology, Vol. 9, No. 2 | 1 June 2015 Cross Ref Approximation methods for large-scale spatial queueing systemsTransportation Research Part B: Methodological, Vol. 74 | 1 Apr 2015 Cross Ref The continuous p-centre problem: An investigation into variable neighbourhood search with memoryEuropean Journal of Operational Research, Vol. 241, No. 3 | 1 Mar 2015 Cross Ref Applied Soft Computing | 2015 Cross Ref Investigating Metaheuristics Applications for Capacitated Location Allocation Problem on Logistics NetworksChaos Modeling and Control Systems Design | 4 December 2014 Cross Ref Heuristics for a continuous multi-facility location problem with demand regionsComputers & Operations Research | 1 Sep 2014 Cross Ref Serving regional demand in facility locationPapers in Regional Science, Vol. 93, No. 3 | 4 April 2013 Cross Ref A historical perspective on location problemsBSHM Bulletin: Journal of the British Society for the History of Mathematics, Vol. 29, No. 2 | 9 May 2014 Cross Ref New heuristic algorithms for solving the planar p-median problemComputers & Operations Research | 1 May 2014 Cross Ref Modeling Influenza Pandemic and Planning Food DistributionManufacturing & Service Operations Management, Vol. 16, No. 1 | 1 Feb 2014 Cross Ref A new local search for continuous location problemsEuropean Journal of Operational Research, Vol. No. 2 | 1 Jan 2014 Cross Ref Location for a continuous competitive facility location problem under & Operations Research, Vol. 41 | 1 Jan 2014 Cross Ref The planar location problem: a clustering approachAnnals of Operations Research, Vol. No. 1 | 1 June 2013 Cross Ref Location of a distribution for a Methods of Operations Research, Vol. 78, No. 3 | 13 July 2013 Cross Ref search heuristics for the single and multi-commodity capacitated Multi-facility Weber & Operations Research, Vol. No. 12 | 1 Dec 2013 Cross Ref New heuristic methods for the single-source capacitated facility Weber International Journal of Technology, Vol. No. | 28 June 2013 Cross Ref Continuous and problems with a on of the Operational Research Society, Vol. 64, No. 11 | 21 December 2017 Cross Ref A hybrid approach for the capacitated p-median Soft Computing, Vol. No. 9 | 1 Sep 2013 Cross Ref An efficient heuristic algorithm for the capacitated Vol. 11, No. 3 | 16 December Cross Ref Continuous location of an Vol. No. 2 | 13 April Cross Ref Heuristics for the single source capacitated multi-facility Weber problemComputers & Industrial Engineering, Vol. 64, No. 4 | 1 Apr 2013 Cross Ref Models and Algorithms for Hub and for Service Facilities in to and An International Vol. 19, No. 2 | 4 Mar 2013 Cross Ref allocation and planning Vol. No. 2 | 9 September Cross Ref A new heuristic for solving the p-median problem in the & Operations Research, Vol. No. 1 | 1 Jan 2013 Cross Ref solution methods for the capacitated multi-facility Weber Transactions, Vol. 45, No. 1 | 1 Jan 2013 Cross Ref A Heuristic Algorithm for Multi-Source Location Problem with under The and Applied Analysis, Vol. 2013 | 1 Jan 2013 Cross Ref Research on Multi-Facility Weber Problem to | 3 May 2013 Cross Ref Investigating of Hybrid to Solve the Multi-Source Weber Problems and Performance of with Optimization Algorithms in Engineering, and | 1 Jan 2013 Cross Ref starting solutions for the p-median problem in the in Discrete Mathematics, Vol. | 1 Dec Cross Ref An Efficient Hybrid Particle Swarm Optimization Algorithm for Solving the Uncapacitated Continuous Location-Allocation and Spatial Vol. 12, No. 3 | 5 July Cross Ref Capacitated Multi-Facility Weber two heuristic & Operations Research, Vol. No. | 1 Jul Cross Ref of and and application in and Vol. No. 2 | 17 March Cross Ref Solving the multi-commodity capacitated multi-facility Weber problem using and a algorithmJournal of the Operational Research Society, Vol. 63, No. 6 | 21 December 2017 Cross Ref Distributed Service Design with and Science, Vol. No. 2 | 1 May Cross Ref A framework of GIS and computing for spatial problems â a case study of Journal of Information Science, Vol. No. 4 | 1 Apr Cross Ref A heuristic algorithm for multiple facilities with regional Optimization and Applications, Vol. No. 3 | 13 January Cross Ref Facility location under demand to a large-scale Planning Vol. No. 1 | 1 Mar Cross Ref Efficient solution methods for the multi-commodity capacitated multi-facility Weber problemComputers & Operations Research, Vol. No. 2 | 1 Feb Cross Ref A algorithm for the planar single-facility location routing problemComputers & Operations Research, Vol. No. 2 | 1 Feb Cross Ref location of two on Journal of Research, Vol. No. 2 | 1 Feb Cross Ref the convergence in the single-source and multi-source Weber Mathematics and Computation, Vol. No. 12 | 1 Feb Cross Ref StandortmanagementStrategisches und operatives Logistikmanagement: Distribution | 25 September Cross Ref A Analysis Method for International Conference on Computational Intelligence and | 1 Dec Cross Ref Solving a continuous local network design problem with a Journal of Operational Research, Vol. No. 3 | 1 Nov Cross Ref Variable neighbourhood search heuristics for the multi-source Weber problemJournal of the Operational Research Society, Vol. No. 10 | 21 December 2017 Cross Ref A GRASP for the capacitated multi-source Weber problemComputers & Operations Research, Vol. No. | 1 Jul Cross Ref Prepositioning in for Journal of Operational Research, Vol. No. 2 | 1 Mar Cross Ref A algorithm for the locationâallocation problem with dense & Operations Research, Vol. No. 2 | 1 Feb Cross Ref Continuous of Location Analysis | 13 January Cross Ref Median Problems in of Location Analysis | 13 January Cross Ref Heuristics for Location of Location Analysis | 13 January Cross Ref An Algorithm for a Capacitated Multi-Facility Weber Problem with Fuzzy International Conference on and | 1 Nov Cross Ref New in location & Operations Research, Vol. No. 10 | 1 Oct Cross Ref The multi-commodity capacitated multi-facility Weber problem: heuristics and Transactions, Vol. No. 11 | 31 Aug Cross Ref Efficient integer for location and routing in Vol. No. 11 | 1 Aug Cross Ref and the spatial and Computer Modelling, Vol. No. 1-2 | 1 Jul Cross Ref Hybrid random algorithm for solving problem of of Computer Applications, Vol. 30, No. 6 | 23 Jun Cross Ref in variable neighborhood Vol. 8, No. 2 | 16 September Cross Ref and heuristic solutions of the chain problem with Journal of Operational Research, Vol. No. 3 | 1 May Cross Ref A generalized Weiszfeld method for the multi-facility location Research Letters, Vol. No. 3 | 1 May Cross Ref based heuristics for the generalized location problemComputers & Industrial Engineering, Vol. No. 4 | 1 May Cross Ref A continuous analysis framework for the solution of locationâallocation problems with dense & Operations Research, Vol. No. 1 | 1 Jan Cross Ref A Weiszfeld algorithm for the solution of an of the generalized location problemComputers & Mathematics with Applications, Vol. No. 1 | 1 Jan Cross Ref Locating a facility using a hybrid optimization Journal of Production Vol. No. 1 | 1 Jan Cross Ref cover location problems: The planar Transactions, Vol. No. 3 | 19 December Cross Ref A locationâallocation heuristic for the capacitated multi-facility Weber problem with Journal of Operational Research, Vol. No. 3 | 1 Nov Cross Ref based optimization approach for network design problemComputers & Industrial Engineering, Vol. 57, No. 1 | 1 Aug Cross Ref The variable Journal of Operational Research, Vol. No. 2 | 1 Jul Cross Ref Discrete heuristics for the capacitated continuous locationâallocation problem with & Operations Research, Vol. 36, No. | 1 Jul Cross Ref Planning for Optical of Optical Communications and Networking, Vol. No. 1 | 1 June Cross Ref based heuristics for the capacitated multi-source Weber problemComputers & Operations Research, Vol. 36, No. 6 | 1 Jun Cross Ref Spatial models for locationâallocation Statistics & Data Analysis, Vol. 53, No. 8 | 1 Jun Cross Ref Solving multi-facility Weber problem by Vol. 31, No. 3 | 1 January Cross Ref The multi-facility locationâallocation problem with polyhedral & Operations Research, Vol. 36, No. 5 | 1 May Cross Ref of to of the Operational Research Society, Vol. No. | 21 December 2017 Cross Ref and of distribution on a of Operations Research, Vol. No. 1 | 14 June Cross Ref Distribution Network for