A Vehicle Routing Problem with Time Windows Subject to the Constraint of Vehicles and Good’s Dimensions
A vehicle routing problem (VRP) can be defined as a problem of finding the optimal route with the goal to minimize the travel distance, time, and cost used in a distribution process. A vehicle routing problem with time windows also known as a Time Window Priority Model (TWPM) prioritizes time wi...
Main Authors: | Carles Sitompul, Octa Manasye Horas |
---|---|
Format: | Article |
Language: | English |
Published: |
Universitas Indonesia
2021-10-01
|
Series: | International Journal of Technology |
Subjects: | |
Online Access: | https://ijtech.eng.ui.ac.id/article/view/4294 |
Similar Items
-
Using a hybrid heuristic to solve the balanced vehicle routing problem with loading constraints
by: Carlos A. Vega-Mejía, et al.
Published: (2019-11-01) -
A new MILP model for vehicle routing-loading problem under fragility, LIFO, and rotation constraints
by: Farnaz Hooshmand, et al.
Published: (2023-03-01) -
Hybrid Heuristic for Vehicle Routing Problem with Time Windows and Compatibility Constraints in Home Healthcare System
by: Payakorn Saksuriya, et al.
Published: (2022-06-01) -
Mathematical models for the periodic vehicle routing problem with time windows and time spread constraints
by: Hande Öztop, et al.
Published: (2020-09-01) -
A New Heuristic Algorithm for Multi Vehicle Routing Problem with AND/OR-Type Precedence Constraints and Hard Time Windows
by: Unes Bahalke, et al.
Published: (2022-06-01)