EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
3495. Multi-Trip Vehicle Routing Problem With Multiple Time Windows and Dynamic Starting Locations
Invited abstract in session TD-64: Dynamic Vehicle Routing 2, stream VeRoLog - Vehicle Routing and Logistics.
Tuesday, 14:30-16:00Room: S16 (building: 101)
Authors (first author is the speaker)
| 1. | Evren Guney
|
| Industrial Engineering, MEF University |
Abstract
Vehicle Routing Problem with Time Windows (VRPTW) is a well-studied challenging combinatorial optimization problem. In this work, we focus on an extension of VRPTW where each vehicle can travel multiple routes, each customer has multiple time windows and each vehicle can start their route from their latest destinations. These kind of problems usually arise in marine routing problems, where a fleet of ships need to visit multiple customer and supplier ports and the trip may end up in any of the ports. Then, their next trip will start in the last port they have visited in their previous trip. Usually the optimization problem is defined over a planning horizon, however the routing scheme and the initial/final locations of the ships are dynamic depending on the planning horizon cut-off dates.
A mixed integer linear programming formulation is developed to represent the problem and various small-sized instances are solved exactly, using commercial solvers. For larger instances various heuristic and meta-heuristic methods are being developed and tested.
Keywords
- Vehicle Routing
- Combinatorial Optimization
- Programming, Mixed-Integer
Status: accepted
Back to the list of papers