No Detail Found!

Solving a new mathematical model for a periodic vehicle routing problem by neighborhood search method

Author(s)
MARLAN Universitas Simalungun, Pematang Siantar, Indonesia
HERMAN MAWENGKANG Department of Mathematics, Universitas Sumatera Utara, Medan, Indonesia
Abstract
For a Periodic Vehicle Routing Problem (PVRP), this study offers a new mathematical model which optimizing vehicle travel expenses based on many assumptions. Periodic planning includes consideration of the following four issues that is a vehicle routing problem with time windows (VRPTW), a capacitated vehicle routing problem (CVRP), a vehicle routing problem with split service (VRPSS) and a vehicle routing problem with simultaneous pickup and delivery (VRPSPD). In large-scale issues, the computational complexity of this problem can be handled by any optimization program in a reasonable amount of time since it is based on a single model that we have created. In this paper a neighborhood search meta-heuristic is proposed.
Publication Details
Page(s) 3935-3943
DOI DOI not available
Published Journal: Journal of Theoretical and Applied Information Technology, Volume: 100, Issue: 12, Year: 2022

Request the full text from PASTIC

Keywords
Neighborhood Search, Logistics, Periodic VRP, Meta-heuristic, Split Service
0

Citations

0

Downloads

28

Views