Multiple trips within working day in capacitated VRP with time windows

  • Authors:

  • Blaž Zmazek

  • Affiliations:

  • Institute of Mathematics, Physics and Mechanics, Ljubljana and Faculty of Mechanical Engeneering, University of Maribor, Maribor, Slovenia

  • Venue:
  • ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

The routing problem has been widely studied in the literature, mainly because of the real world logistics and transportation problems related to it. In the paper, new instance of VRP problem capacitated VRP with time windows and multiple trips within working day (CVRPTWMT), which arising from the real-world routing applications is given. A new approach for solving a real problem is shown and an algorithm which consists of a direct approach and an optimization method is given. In the algorithm feasible routes are generated by a direct approach and optimized by a local optimization method. The best feasible routes in the first stage of algorithm are determined by one meatheuristic method. Based on the algorithm, an interactive decision support system was developed and tested on the real instances.