A Hybrid Metaheuristic for the Multiple Depot Vehicle Routing Problems with Mix Pickups and Deliveries

Jian Li; Dong Lu; Ming Dai

doi:10.4028/www.scientific.net/AMR.538-541.3230

Paper Titles

Rush Repair Method and Suggestion of Long-Span Arch Bridge in Wartime
p.3211

Optimal Design of Lower Extremity for Portable Human Exoskeletons Using Improved Particle Swarm Optimization
p.3215

The Optimized Method Research of Spare Parts Based on the Supportability Possibility
p.3222

Topology Optimization and Analysis of Sub-Frame of 2500HP Fracturing Truck
p.3226

A Hybrid Metaheuristic for the Multiple Depot Vehicle Routing Problems with Mix Pickups and Deliveries
p.3230

The Application of Virtual Prototyping Technology in the Kinematic Analysis of Hydraulic Excavator Working Device
p.3235

A Comparative Study on Statistics Based on Binary Data and Fuzzy Data in Office Chair Design
p.3240

Probabilistic Approach for Cost Optimization of Structural Materials Using Plastic Hinge Mechanism
p.3244

Analysis and Optimal Design on Electrical Dust Precipitator Steel Structures
p.3249

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 538-541A Hybrid Metaheuristic for the Multiple Depot...

A Hybrid Metaheuristic for the Multiple Depot Vehicle Routing Problems with Mix Pickups and Deliveries

Abstract:

The multiple depot vehicle routing problems with mix pickups and deliveries are often met in real-life scenarios of transportation logistics, but it has not received much attention by researchers. In this problem, to allocate borderline customer to appropriate depot is a difficulty to overcome. In this paper, a genetic algorithm is supposed to allocate them. Then the tabu search algorithm is incorporated into the genetic algorithm to solve the single depot vehicle routing problems with mix pickups and deliveries. The proposed algorithm is successfully applied to benchmark instances in the literature, generating new best solutions.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 538-541)

Pages:

3230-3234

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.538-541.3230

Citation:

Cite this paper

Online since:

June 2012

Authors:

Jian Li, Dong Lu, Ming Dai

Keywords:

Genetic Algorithm (GA), Picks and Deliveries, Tabu Search Algorithm, Vehicle Routing Problem (VRP)

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] G. Nagy and S. Salhi: Eur. J. Oper. Res. Vol. 162(2005), p.126–141.

Google Scholar

[2] S. Salhi and G.Nagy: J. Oper. Res. Soc. Vol. 50(1999), p.1034–1042.

Google Scholar

[3] S. Salhi and M. Sari: Eur. J. Oper. Res. Vol. 103 (1997), pp.95-112.

Google Scholar

[4] F. Glover: ORSA J. Comput. Vol. 1 (1989), p.190–206.

Google Scholar

[5] J. Li and Q.L. Da: Journal of SoutheastUniversity (English Edition), Vol. 24 ( 2008), pp.222-227.

Google Scholar

[6] Z. Fu, R. Eglese and L. Y. O. Li: J. Oper. Res. Soc. Vol. 56 (2005), p.267–274.

Google Scholar

[7] S. Lin: Bell Sys. Tech. J. Vol. 44 (1965), p.2245–2269.

Google Scholar

[8] I. Or: Traveling salesman-type combinational problems and their relation to the logistics of blood banking. (Northwestern University ,Chicago, Illinois, USA 1976).

Google Scholar