The Vehicle Routing Problem (VRP) is a critical component of many logistics systems involving the routing and scheduling of vehicles from a depot to a set of customer nodes. The Vehicle Routing Problem with Time Window (VRPTW) is one of the most studied versions of VRP, in which each customer must be visited within a specific time interval known as a time window. It has previously been demonstrated that VRPTW is an NP-hard problem, which means that finding optimal solutions for large problems is computationally difficult. As a result, a number of heuristics and metaheuristics have been proposed. This study aims to develop a new relaxation scheme that loosens the constraints of the time window, resulting in a feasible and good solution. Furthermore, as an alternative model for VRPTW that is time dependent and involves multiple suppliers, this research will develop a discrete optimization model. This study will also create a metaheuristic algorithm with an initial solution defined by relaxing the time window.
Skip Nav Destination
Article navigation
9 May 2023
2ND INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION SCIENTIFIC DEVELOPMENT (ICAISD) 2021: Innovating Scientific Learning for Deep Communication
5–6 August 2021
Jakarta, Indonesia
Research Article|
May 09 2023
A binary programming model for logistics problems with multi-suppliers and relaxed time Windows
Muliawan Firdaus;
Muliawan Firdaus
a)
1)
Graduate School of Mathematics, Universitas Sumatera Utara
, Medan, Indonesia
Search for other works by this author on:
Herman Mawengkang;
Herman Mawengkang
b)
2)
Department of Mathematics, Universitas Sumatera Utara
, Medan, Indonesia
b)Corresponding author: [email protected]
Search for other works by this author on:
Tulus;
Tulus
c)
2)
Department of Mathematics, Universitas Sumatera Utara
, Medan, Indonesia
Search for other works by this author on:
Sawaluddin
Sawaluddin
d)
2)
Department of Mathematics, Universitas Sumatera Utara
, Medan, Indonesia
Search for other works by this author on:
b)Corresponding author: [email protected]
a)
Electronic mail: [email protected]
c)
Electronic mail: [email protected]
d)
Electronic mail: [email protected]
AIP Conf. Proc. 2714, 030040 (2023)
Citation
Muliawan Firdaus, Herman Mawengkang, Tulus, Sawaluddin; A binary programming model for logistics problems with multi-suppliers and relaxed time Windows. AIP Conf. Proc. 9 May 2023; 2714 (1): 030040. https://doi.org/10.1063/5.0128475
Download citation file:
Pay-Per-View Access
$40.00
Sign In
You could not be signed in. Please check your credentials and make sure you have an active account and try again.
23
Views
Citing articles via
Inkjet- and flextrail-printing of silicon polymer-based inks for local passivating contacts
Zohreh Kiaee, Andreas Lösel, et al.
Effect of coupling agent type on the self-cleaning and anti-reflective behaviour of advance nanocoating for PV panels application
Taha Tareq Mohammed, Hadia Kadhim Judran, et al.
Design of a 100 MW solar power plant on wetland in Bangladesh
Apu Kowsar, Sumon Chandra Debnath, et al.
Related Content
A comprehensive study of vehicle routing problem with time windows using multi-objective ant colony system
AIP Conf. Proc. (July 2023)
Large neighbourhood search to optimize fresh vegetables distributions (a case study)
AIP Conf. Proc. (November 2018)
Optimization of vehicle routing problem with time windows using nearest neighbor algorithm and dynamic programming (case study: Pekalongan city Environmental Agency)
AIP Conf. Proc. (June 2023)
A proposed taxonomy for literature review in multi-objective vehicle routing problems
AIP Conf. Proc. (February 2024)
Solving the time dependent vehicle routing problem by metaheuristic algorithms
AIP Conference Proceedings (February 2015)