A hybrid metaheuristics approach for a multi-depot vehicle routing problem with simultaneous deliveries and pickups
by Sonu Rajak; P. Parthiban; R. Dhanalakshmi
International Journal of Mathematics in Operational Research (IJMOR), Vol. 15, No. 2, 2019

Abstract: Multi-depot vehicle routing problem with simultaneous deliveries and pickups (MDVRPSDP) is a variant of classical vehicle routing problem (VRP), which has often encountered in real-life scenarios of transportation logistics; Where, vehicles are required to simultaneously deliver the goods and also pick-up some goods from the customers. The current scenario importance of reverse logistics activities has increased. Therefore it is necessary to determine efficient and effective vehicle routes for simultaneous delivery and pick-up activities. MDVRPSDP, which is very well-known non-deterministic polynomial-hard (NP-hard) and combinatorial optimisation (CO) problem, which requires metaheuristics to solve this type of problems. In this context, this article presents a hybrid metaheuristic which combines simulated annealing (SA), ant colony optimisation (ACO) and along with long-arc-broken removal heuristic approach for solving the MDVRPSDP. The preliminary results show that the proposed algorithm can provide good solutions.

Online publication date: Fri, 16-Aug-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com