A Decision Model For Tackling Logistic Optimization Problem in Online Business Environment
DOI:
10.33395/sinkron.v7i3.11593Abstract
Online business has increased during the COVID-19 pandemic, but the emergence of a number of problems, namely reduced material supply, price fluctuations because an item is difficult to distribute and slow delivery due to transportation of goods based on the type of transportation used (Trucks, Trains, Airplanes and Ships). a number of declines due to the COVID-19 virus pandemic, resulting in longer order waiting times. Pick-up and Delivery Issues are variations of Vehicle Routing Issues that appear in many real-world transportation scenarios, such as product delivery and courier services. This work studies the Pickup and Delivery Problem with Time Windows, where goods must be transported from one location to another, with taking into account certain time limits and vehicle capacity. This aims to minimize the number of vehicles used, as well as operational costs for all routes. To solve this problem, a mathematical model in the form of is used Mixed Integer Linear Programming (MILP) from Pickup and Delivery Problems with Time Windows
Downloads
References
Battiti, R.; Protasi, M. Reactive Search, A History-Sensitive Heuristic For Max-Sat. Journal OfExperimental Algorithmics (Jea), Acm, New York, Ny, Usa, V. 2, Jan. 1997.
Bent, R.; Hentenryck, P. V. A Two-Stage Hybrid Algorithm For Pickup And Delivery Vehicle Routing Problems With Time Windows. Computers & Operations Research, Elsevier, V. 33, N. 4, P. 875–893, 2006.
Bruggen, L. Van Der; Lenstra, J. K.; Schuur, P. Variable-Depth Search For The Single-Vehicle Pickup And Delivery Problem With Time Windows. Transportation Science, Informs, V. 27, N.3, P. 298–311, 1993.
Cordeau, J.-F.; Laporte, G.; Ropke, S. Recent Models And Algorithms For One-To-One Pickup And Delivery Problems. In: . The Vehicle Routing Problem: Latest Advances And NewChallenges. Boston, Ma: Springer Us, 2008. P. 327–357.
Dantzig, G. B.; Ramser, J. H. The Truck Dispatching Problem. Management Science, Informs,V. 6, N. 1, P. 80–91, 1959.
Desrosiers, J.; Dumas, Y.; Soumis, F. A Dynamic Programming Solution Of The Large-Scale Single-Vehicle Dial-A-Ride Problem With Time Windows. American Journal Of Mathematical AndManagement Sciences, Taylor & Francis, V. 6, N. 3-4, P. 301–325, 1986.
Gehring, H.; Homberger, J. A Parallel Hybrid Evolutionary Metaheuristic For The Vehicle RoutingProblem With Time Windows. In: Citeseer. Proceedings Of Eurogen99. [S.L.], 1999. V. 2,P. 57–64.
Grandinetti, L. Et Al. The Multi-Objective Multi-Vehicle Pickup And Delivery Problem With TimeWindows. Procedia - Social And Behavioral Sciences, V. 111, P. 203 – 212, 2014. Issn 1877-0428.
Hasle, G.; Lie, K.-A.; Quak, E. Geometric Modelling, Numerical Simulation, And Optimization –Applied Mathematics At Sintef. [S.L.]: Springer Science & Business Media, 2007.
King, G. F.; Mast, T. M. Excess Travel: Causes, Extent, And Consequences. [S.L.]: TransportationResearch Board, 1987.
Lourenco, H. R. Job-Shop Scheduling: Computational Study Of Local Search And Large-Step Optimization Methods. European Journal Of Operational Research, Elsevier, V. 83, N. 2, P. 347–364, 1995.
Lourenço, H. R.; Martin, O. C.; Stützle, T. Iterated Local Search: Framework And Applications. In: . Handbook Of Metaheuristics. Boston, Ma: Springer Us, 2010. P. 363–397.
Merz, P.; Huhse, J. An Iterated Local Search Approach For Finding Provably Good Solutions For Very Large Tsp Instances. In: Springer. International Conference On Parallel Problem Solving FromNature. [S.L.], 2008. P. 929–939.
Morais, V. W.; Mateus, G. R.; Noronha, T. F. Iterated Local Search Heuristics For The Vehicle Routing Problem With Cross-Docking. Expert Systems With Applications, Elsevier, V. 41, N. 16,P. 7495–7506, 2014.
Nanry, W. P.; Barnes, J. W. Solving The Pickup And Delivery Problem With Time Windows Using Reactive Tabu Search. Transportation Research Part B: Methodological, Elsevier, V. 34, N. 2, P.107–121, 2000.
Penna, P. H. V.; Subramanian, A.; Ochi, L. S. An Iterated Local Search Heuristic For The Heterogeneous Fleet Vehicle Routing Problem. Journal Of Heuristics, Springer, V. 19, N. 2, P.
Ropke, S.; Cordeau, J.-F.; Laporte, G. Models And Branch-And-Cut Algorithms For Pickup And Delivery Problems With Time Windows. Networks, Wiley Online Library, V. 49, N. 4, P. 258–272, 2007.
, N. 4, P. 474–490, 1998. Savelsbergh, M. W. The Vehicle Routing
Problem With Time Windows: Minimizing Route Duration. Orsa Journal On Computing,Informs, V. 4, N. 2, P. 146–154, 1992.
Solomon, M. M. Algorithms For The Vehicle Routing And Scheduling Problems With Time Window Constraints. Operations Research, Informs, V. 35, N. 2, P. 254–265, 1987.
Stützle, T. Iterated Local Search For The Quadratic Assignment Problem. European Journal OfOperational Research, Elsevier, V. 174, N. 3, P. 1519–1539, 2006.
Toth, P.; Vigo, D. The Vehicle Routing Problem. In: Toth, P.; Vigo, D. (Ed.). Philadelphia, Pa,Usa: Society For Industrial And Applied Mathematics, 2001. Chp. An Overview Of Vehicle Routing Problems, P. 1–26.
Trego, T.; Murray, D. An Analysis Of The Operational Costs Of Trucking. In: Transportation Research Board 2010 Annual Meetings. Washington, Dc. [S.L.: S.N.], 2010. V. 18, P. 20.
Downloads
|
How to Cite
Issue
Section
License
Copyright (c) 2022 Syahraini, Syahril Efendi, Syahriol Sitorus
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Muhammad Khoiruddin harahap
Google Scholar 
Moraref
PKP Index
Garuda Kemdikbud
Indonesia OneSearch
OCLC Worldcat
Dimensions
Index Copernicus
Scilit
