Developing an Approximation Algorithm for the Vehicle Routing Problem with Operating Time Constraints  

Oleh:

Suzuki, Ayana ; Ishii, Tomohisa ; Ishigaki, Aya ; Lidia, Mariany ; Basri, Mursyid Hasan

Jenis: Article from Proceeding
Dalam koleksi: The 14th Asia Pacific Industrial Engineering and Management Systems Conference (APIEMS), 3-6 December 2013 Cebu, Philippines, page 1-8.
Topik: Vehicle Routing Problem; Multiple Trips; Operating Time Constraints; Meta heuristics
Fulltext: 1100.pdf (454.38KB)

Isi artikel

This study investigates vehicle operating time as a constraint within the vehicle routing problem with multiple trips (VRPMT). In the basic vehicle routing problem, one route is assigned to one vehicle and the solution must satisfy both load and distance (or travel time) constraints. However, in the real-world problem, one vehicle is assigned to multiple routes per day. Since this problem becomes a large-scale combinatorial optimization problem, it is difficult to find an exact solution. Therefore, in preceding research, a heuristic method using a two-phase algorithm is proposed. However, since the precision of a two-phase algorithm is greatly influenced by the solution selected for the first phase, one must pay attention to the selection of a solution in this phase. In this research, a heuristic method using the one-phase algorithm for VRPMT is proposed.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali