The formulation of a linear programming model for the vehicle routing problem in order to minimize idle time
The paper deals with the question, “What is the Vehicle Routing Problem, Which Is Minimized Idle Time, and How Its Linear Programming Model Is Written?” In this study, a linear programming (LP) model has been developed for the vehicle routing problem (VRP) in order to minimize the total idle time (M...
Main Authors: | Ömer Nuri Çam, Hayrettin Kemal Sezen |
---|---|
Format: | Article |
Language: | English |
Published: |
Regional Association for Security and crisis management
2020-03-01
|
Series: | Decision Making: Applications in Management and Engineering |
Subjects: | |
Online Access: | https://dmame.rabek.org/index.php/dmame/article/view/55 |
Similar Items
-
Parallel Makespan Calculation for Flow Shop Scheduling Problem with Minimal and Maximal Idle Time
by: Jarosław Rudy
Published: (2021-09-01) -
Effect of transport vehicles on the grain harvester idle time during harvesting
by: G. Tihanov
Published: (2021-06-01) -
Frequency-based Vehicle Idling Detection
by: Kai-Chao Yang, et al.
Published: (2014-02-01) -
The multi-depot electric vehicle location routing problem with time windows
by: Juan Camilo Paz, et al.
Published: (2018-01-01) -
Replenishment policies for imperfect inventory system under natural idle time and shortages
by: Jaggi Chandra K., et al.
Published: (2020-01-01)