Green Open Vehicle Routing and Schedulling Problem Considering the Time Spent in Traffic Congestion
Almira1, Herman Mawengkang2, Saib Suwilo3, Tulus4

1Almira, Graduate, School of Computer Science, Universitas Sumatera Utara, Malaysia.
2Herman Mawengkang, Graduate, School of Mathematics, Universitas Sumatera Utara, Malaysia.
3Saib Suwilo, Graduate, School of Mathematics, Universitas Sumatera Utara, Malaysia.
4Tulus, Graduate, School of Mathematics, Universitas Sumatera Utara, Malaysia.
Manuscript received on 09 May 2019 | Revised Manuscript received on 19 May 2019 | Manuscript Published on 23 May 2019 | PP: 1452-1455 | Volume-7 Issue-6S5 April 2019 | Retrieval Number: F12570476S519/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: The current world has seen technology emerge as a field that plays a significant role in promoting sustainable development. Technological provisions are projected to form the key determinant of attaining enterprise objectives. This projection accounts for the manner in which different technology-related firms continue to grapple with inventions and innovations, as well as explorations of theories responsible for understanding the people’s adoption of new systems. The process of adopting a new product, behavior, or idea constitutes an innovation. Notably, the diffusion process does not take place simultaneously in social systems. Rather, some people end up being more apt to adopt the system; compared to others.This paper discusses a green open vehicle routing and scheduling problem (GOVRSP) model with aim to minimize CO2 emissions in logistics systems. A heuristic algorithm of MILP and iterated neighborhood search is addressed to solve the problem.
Keywords: Green Vehicle Routing Problem, Scheduling, Traffic Congestion, Neighborhood Search.
Scope of the Article: Green Computing