Demand robust counterpart open capacitated vehicle routing problem time windows and deadline model of garbage transportation with LINGO 13.0

Abstract

Demand robust counterpart-open capacitated vehicle routing problem with time windows and deadline (DRC-OCVRPtw,d) model formed and explained in this paper, is the model used to find the minimum distance and the time needed for vehicles to transport garbage in Sukarami Sub-District, Palembang that consists of the time it takes for the vehicle to pass through the route. Time needed to transport garbage to the vehicle is called time windows. Combination of the thoses times is called deadline. The farther 
 the distance passed by vehicle and the more garbage transported, the longer the deadline is needed. This DRC-OCVRPtw,d model is completed by LINGO 13.0 to obtain the optimal route and time deadline for Sukarami Sub-District. The model shows that the improved model of open vehicle routing problem involving the robustness, time windows and deadline can achieve the optimal routes that enable driver to save operational time in picking up the garbage compared to similar problem not involving no-time windows and deadline stated in previous research.

Solving hybrid-vehicle routing problem using modified simulated annealing

“…However, PSO might be stuck into local optima; therefore, multi-swarm particle swarm optimization (MSPSO) has been used by other researchers, where the swarm is divided into sub-swarms, and the movement process of a particle is enhanced with a probability of bisection method, see Alfarisy et al [11]. Puspita et al [12], [13] have modeled an optimization waste transport as a CVRP and solved it using branch and bound method with the aid of LINGO 13.0.…”

Pickup and delivery problem in the collaborative city courier service by using genetic algorithm and nearest distance

“…𝑟 𝑜 = 𝑛(𝑂 𝑜 ) 𝑛(𝑂)(14)𝑂 𝑜 = {𝑜|𝑜 ∈ 𝑂 ∧ 𝑝 𝑜 (𝑜) ≠ 𝑝 𝑒 (𝑜)}(15) ISSN: 2302-9285 Bulletin of Electr Eng & Inf, Vol. 11, No.…”