Next Article in Journal
Logistics Services Sector and Economic Recession in Greece: Challenges and Opportunities
Previous Article in Journal
Unravelling the Complexity of Supply Chain Volatility Management
Article Menu

Export Article

Open AccessArticle
Logistics 2018, 2(3), 15; https://doi.org/10.3390/logistics2030015

Heuristics Algorithms for a Heterogeneous Fleets VRP with Excessive Demand for the Vehicle at the Pickup Points, and the Longest Traveling Time Constraint: A Case Study in Prasitsuksa Songkloe, Ubonratchathani Thailand

1
Department of Computer Science, Faculty of informatics, Mahasarakham University, Maha Sarakham 44000, Thailand
2
Department of Industrial Engineering, Faculty of Engineering, Khon Kaen University, Khon Kaen 40002, Thailand
*
Author to whom correspondence should be addressed.
Received: 23 June 2018 / Revised: 21 August 2018 / Accepted: 21 August 2018 / Published: 28 August 2018
Full-Text   |   PDF [2512 KB, uploaded 28 August 2018]   |  

Abstract

This paper presents a methodology to solve a special case of the vehicle routing problem (VRP) called the heterogeneous fleets VRP with excessive demand of the vehicle at the pickup points, and the longest time constraint (HFVRP-EXDE-LTC). We developed two metaheuristics—a differential evolution (DE) algorithm and an adaptive large neighborhood search (ALNS)—to solve the problem. These two proposed methods have been designed to effectively solve a special case of VRP. From the computational results, we can see that the proposed heuristics outperformed the best practices that are currently in use. The DE yielded a 9.78% lower cost than that of the current practice (757,250 baht per year), while ALNS generated a 10.89% (906,750 baht per year) lower cost than that of current practice. Comparing the proposed heuristics, ALNS achieved a 1.01% lower cost than that of DE, as ALNS had a better mechanism that was designed to escape from the local optimal. View Full-Text
Keywords: vehicle routing problem; adaptive large neighborhood search; differential evolution algorithm; pickup and delivery system; school bus vehicle routing problem; adaptive large neighborhood search; differential evolution algorithm; pickup and delivery system; school bus
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Kaewman, S.; Akararungruangkul, R. Heuristics Algorithms for a Heterogeneous Fleets VRP with Excessive Demand for the Vehicle at the Pickup Points, and the Longest Traveling Time Constraint: A Case Study in Prasitsuksa Songkloe, Ubonratchathani Thailand. Logistics 2018, 2, 15.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Logistics EISSN 2305-6290 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top