A cluster insertion-based heuristic with load-dependent service times and transportation costs for the vehicle routing problem with backhauls and time windows  

Oleh:

Gutierrez, Michael ; Cruz, Dennis

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-17.
Topik: vehicle routing problem; backhauling; network heuristics
Fulltext: 2020.pdf (745.87KB)

Isi artikel

The Vehicle Routing Problem with Backhauls and Time Windows deals with the construction of an optimal route for a vehicle that minimizes a certain cost function whilst ensuring that delivery demand is met for all linehaul customers and pickup demand is met for all backhaul customers within the network. Currently, there are two existing approaches to solving the problem—the classical approach and the mixed approach—but neither are able to optimize the problem fully because of the complications brought about by backhauling. The study has broken these complications down into two main causes: load reshuffling and increased gas consumption. To address this, the study proposes a third and optimal approach—one that incorporates load-dependent service times and load-dependent transportation costs. An insertion-based heuristic which incorporates these features is created and validated upon a small network problem. The results have shown that the proposed approach yields superior solution costs against the two existing approaches when load-dependency of transportation costs and service times are acknowledged.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali