Solving Vehicle Routing Problem with Multiple Trips, Multiple Depots and Heterogeneous Fleet of Vehicles based on Set Partitioning Problem Formulation  

Oleh:

Suprayogi ; Susanty, Susy

Jenis: Article from Proceeding
Dalam koleksi: APCOMS 2009: The 2nd Asia-Pacific Conference on Manufacturing System: Reconfigurable Manufacturing System for Facing Turbulent Manufacturing Environment, November 4th-5th, 2009, Yogyakarta, Indonesia, page IV.31-36.
Topik: Vehicle Routing Problem; Multiple Trips; Multiple Depots; Heterogeneous Fleet Of Vehicles; Set Partitioning Problem
Fulltext: APCOMS G4-5.pdf (154.44KB)

Isi artikel

This paper presents a vehicle routing problem (VRP) with multiple trips, multiple depots, and heterogeneous fleet of vehicles. Decisions of the problem include a set of tour visiting customers, the vehicle type used for each tour, and the depot where vehicles are stationed. The objective function is to minimize total cost including fixed and variable costs. A solution approach based on a set partitioning problem (SPP) formulation is proposed. The solution approach is divided into three stages: generating tours with single routes, generating tours with multiple routes, and solving the SPP formulation. A numerical example is given to illustrate the solution.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali