A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Novel Encoding and Routing Balance Insertion Based Particle Swarm Optimization with Application to Optimal CVRP Depot Location Determination
2015
Mathematical Problems in Engineering
Preserved Fulltext
Vehicle routing problems from an operation research library were tested and an average of 16% total routing distance improvement between having and not having planned the optimal depot locations is obtained ...
Meanwhile, a routing balance insertion (RBI) local search is designed to improve the solution quality. ...
proposed an effective variable neighborhood search scheme based on reversing the routing segment and exchanging routing segments for solving the open VRP to minimize the number of vehicles as well as the ...
doi:10.1155/2015/743507
fatcat:lf7d3tft4fddria3fq3eus5n2m
GRASP with Path Relinking for the Two-Echelon Vehicle Routing Problem
[chapter]
2013
Operations Research/Computer Science Interfaces Series
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We propose a meta-heuristic based on GRASP combined with Path Relinking to address the Two-Echelon Vehicle Routing Problem, an extension of the Capacitated Vehicle Routing Problem in which the delivery ...
The meta-heuristic scheme consists of applying a GRASP and a local search procedure in sequence. Then, the resulting solution is linked to an elite solution by means of a Path Relinking procedure. ...
Acknowledgments Partial funding for this project has been provided by the Natural Sciences and Engineering Council of Canada (NSERC). We also gratefully acknowledge the support of Fonds de ...
doi:10.1007/978-1-4614-6322-1_7
fatcat:7gpfu37fm5axrnzcy6v5f4nuee
New Evolutionary Algorithm Based on 2-Opt Local Search to Solve the Vehicle Routing Problem with Private Fleet and Common Carrier
2011
International Journal of Applied Metaheuristic Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The authors describe hybrid Iterated Density Estimation Evolutionary Algorithm with 2-opt local search to determine the specific assignment of each tour to a private vehicle (internal fleet) or an outside ...
In this paper, the authors examine a class of vehicle routing in which a fixed internal fleet is available at the warehouse in the presence of an external transporter. ...
Several authors have studied the vehicle routing problem with limited fleet. Osman and Salhi (1996) proposed local search strategies to solve the vehicle fleet mix problem. ...
doi:10.4018/ijamc.2011010105
fatcat:xaxmyvlin5e3jdw44edjsejzru
An Optimized Scalable Multi-ant Colony System for Multi-depot Vehicle Routing Problems Using a Reactive Multi-agent System
2021
WSEAS Transactions on Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
This paper presents a multi-ant colony system to solve the multi-depot vehicle routing problem using a reactive agent-based approach. ...
The solution of the multi-depot vehicle routing problem is beneficial and helpful for many real applications. ...
Subsequently, Li et al. [14] proposed an adaptive local search algorithm based on a hybrid genetic solution to solve the MDVRP with timewindows within shared depot resources. ...
doi:10.37394/23202.2021.20.28
fatcat:rvgsmwsyyfcbrbhocaox6hcmn4
Five years of multi-depot vehicle routing problems
2020
Journal of Sustainable Development of Transport and Logistics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The objective of this problem is to find the routes for vehicles to serve all the customers at a minimal cost in terms of the number of routes and the total distance travelled without violating the capacity ...
With vast range of applications in real life situations, the Vehicle Routing Problems (VRPs) have been the subject of countless studies since the late 1950s. ...
Li et al., 2015) and solved using a meta-heuristic approach based on an iterated local search. ...
doi:10.14254/jsdtl.2020.5-2.10
fatcat:57aipolrqzax3dlomhu2ssz7tm
Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem
2014
International Transactions in Operational Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper proposes a hybrid algorithm, combining Biased-Randomized (BR) processes with an Iterated Local Search (ILS) meta-heuristic, to solve the Multi-Depot Vehicle Routing Problem (MDVRP). ...
way -according to a distance-based criterion; and (b) generate 'good' routing solutions for each customers-depots assignment map. ...
ACKNOWLEDGMENTS This work has been partially supported by the Spanish Ministry of Science and Innovation (TRA2010-21644-C03) and by the Ibero-American Programme for Science, Technology and Development ...
doi:10.1111/itor.12101
fatcat:4bx2ctbxmfhvtjy3qwzgnwlawm
A REVIEW OF SINGLE AND POPULATION-BASED METAHEURISTIC ALGORITHMS SOLVING MULTI DEPOT VEHICLE ROUTING PROBLEM
2018
International Journal of Software Engineering and Computer Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Multi-Depot Vehicle Routing Problem (MDVRP) arises with rapid development in the logistics and transportation field in recent years. ...
This article reviews on single and population-based metaheuristic methods solving MDVRP from the year 2013 until 2018. ...
Table 5 shows an application of single-based and population-based metaheuristic algorithm used in various variants of metaheuristic algorithms in multi-depot vehicle routing problem. ...
doi:10.15282/ijsecs.4.2.2018.6.0050
fatcat:mcuaej2grzewfdkdvt3khge4tu
An approach based on Clustering AH and VND for Supply Chain Management
2021
International Journal of Intelligent Engineering and Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In the first phase, we select the depots to be opened, allocate the customers to open depots using a Hierarchical Ascendant (HA) method and we solve the vehicle routing problem for each depot using Sweep ...
In this work, we present a new approach to solve the Capacitated Location-Routing Problem (CLRP). ...
A branch-and-cut algorithm based on an integer formulation for solving this problem is presented in [16] . ...
doi:10.22266/ijies2021.0228.29
fatcat:giy5hu6jw5da3jzyn7mfrf2i2m
General solution approaches for multi-attribute vehicle routing and scheduling problems
2013
4OR
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
analysis of the impact of time-window relaxations within local-search heuristics for vehicle routing. ...
Two metaheuristics based on these concepts, an Iterated Local Search (ILS) and a HGSADC, are presented. ...
doi:10.1007/s10288-013-0240-5
fatcat:y6t7xeeejrhxrdtfqu7gb55caa
Multi-Depot Green Vehicle Routing Problem to Minimize Carbon Emissions
2020
Sustainability
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
A Multi-Depot Green Vehicle Routing Problem (MDGVRP) is considered in this paper. ...
The first type of ant is used to assign customers to depots, while the second type of ant is used to find the routes. ...
MDGVRP Local Search After generating an ant-solution for MDGVRP, we apply an MDGVRP local search on each MDGVRP solution. ...
doi:10.3390/su12083500
fatcat:6pccdnet4zcojkqh3acxmkx53q
Page 264 of The Journal of the Operational Research Society Vol. 51, Issue 3
[page]
2000
The Journal of the Operational Research Society
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Their article introduces several formulations for the traveling salesman problem: (1) m-traveling salesman problem; (2) vehicle routing problem; and (3) multi-depot vehicle routing problem. ...
Exact solution techni- ques used to solve small size vehicle routing problems can be put into three broad categories. ...
An ant colony optimization technique for solving min–max Multi-Depot Vehicle Routing Problem
2013
Swarm and Evolutionary Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
This article presents an extension of an existing ant-colony technique for solving the Single Depot Vehicle Routing Problem (SDVRP) to solve the multiple depots and min-max variants of the problem. ...
LP based method. ...
In 2004, Bell et al. [28] developed multiple ant colony methods to solve the vehicle routing problem. ...
doi:10.1016/j.swevo.2013.05.005
fatcat:amegfnzdcjc63kvool43hrczmq
A novel approach to combine the hierarchical and iterative techniques for solving capacitated location-routing problem
2018
Cogent Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This study focuses on the capacitated location-routing problem (CLRP), which is a combination of capacitated facility location problem and capacitated vehicle routing problem. ...
The proposed approach consists of unique assignment techniques of the customers to the opened depots and a tri-fold PSO based searching strategy which combines the influence of both hierarchical and iterative ...
Decoding a customer vector to make comprehensive representation of clusters
PSO fold for vehicle routing stage Upon getting clusters for opened hubs, we utilize bilayer local search based PSO (BLS-PSO ...
doi:10.1080/23311916.2018.1463596
fatcat:p4hfnwglerfz5kpf6e5bcytzk4
Page 65 of The Journal of the Operational Research Society Vol. 54, Issue 1
[page]
2003
The Journal of the Operational Research Society
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
solving both the classical VRP and HVRP use local search techniques inter-route customer exchanges and variable pool-based procedures. ** The feasi-
based on intra- or bility check or the evaluation of ...
He developed a heuristic column generation method based on the Adaptive Memory Procedure (AMP),’ which uses an embedded tabu search due to Taillard.'” ...
A generalized crossing local search method for solving vehicle routing problems
2007
Journal of the Operational Research Society
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
An assignment-based local search method for solving vehicle routing problems. Asia-Pacific J Opl Res 22: 85-104.
Received 26 May 2005; accepted November 2005 after one revision ...
of Singapore, Kent Ridge, Singapore
In this paper, we propose a generalized crossing local search method for solving vehicle routing problems. ...
doi:10.1057/palgrave.jors.2602171
fatcat:d44oyoacujbulnr72fnrafu7j4
« Previous
Showing results 1 — 15 out of 38,346 results