EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
578. Multi-Objective Shipment Consolidation and Dispatching Problem
Invited abstract in session MB-58: Heuristics for Vehicle Routing 3, stream VeRoLog - Vehicle Routing and Logistics.
Monday, 10:30-12:00Room: S07 (building: 101)
Authors (first author is the speaker)
| 1. | Ozgur Ozpeynirci
|
| Department of Logistics Management, Izmir University of Economics | |
| 2. | Ozge Buyukdeveci
|
| Industrial Engineering, Dokuz Eylul | |
| 3. | Selin Özpeynirci
|
| Industrial Engineering, Izmir University of Economics |
Abstract
In recent years, with the increase in global production and demand, transportation problems have become a widely studied area, and studies focus on providing high-quality service at the lowest cost. This study considers a bi-objective shipment consolidation and dispatching problem with the objectives of minimizing the total cost and the total distance. In order to create a non-dominated solution set, a multi-objective mixed integer linear programming model is developed and augmented epsilon constraint method is used to generate the non-dominated frontier. However, this approach is not capable of finding the non-dominated solution set in a reasonable time, even for small-sized instances, and therefore, we propose a multi-objective variable neighborhood search heuristic. To measure the performance of the proposed approach, a computational experiment is conducted on randomly generated instances available in the literature. The experimental results indicate that the multi-objective variable neighborhood search heuristic performs efficiently in reasonable time.
Keywords
- Transportation
- Vehicle Routing
- Multi-Objective Decision Making
Status: accepted
Back to the list of papers