Developing an Optimization Model for Vehicle Routing Problem with Time Windows Considering Delivery and Pick-Up Simultasneously
Erwin1, Joni2, Herman Mawengkang3

1Erwin, STIE Mikroskil, Medan, Indonesia.
2Joni, STMIK Time Medan, Indonesia.
3Herman Mawengkang, Department of Mathematics, University of Sumatera Utara, Medan, Indonesia.
Manuscript received on 09 May 2019 | Revised Manuscript received on 19 May 2019 | Manuscript Published on 23 May 2019 | PP: 1469-1473 | Volume-7 Issue-6S5 April 2019 | Retrieval Number: F12600476S519/2019©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (

Abstract: Vehicle Routing Problem (VRP) is a key element of many distribution systems which involve routing and selecting of vehicles through a set of nodes. Wireless modes of communication have received attention to such an extent that some of the cities in the world cannot operate without digital control systems. Notably, developments have been implemented beyond operations such as WLAN and mobile phones, witnessing the arrival of time windows in cities such as London and Stockholm. The paper investigates a variant of VRP which incorporates time windows, fleet and driver scheduling, pick-up and delivery in the planning horizon.
Keywords: Developing Optimization Routing Problem Model Control Systems.
Scope of the Article: Cross Layer Design and Optimization