Delivery Route Optimization Through Occupancy Prediction from Electricity Usage

Author(s):  
Shimpei Ohsugi ◽  
Noboru Koshizuka
Author(s):  
Takashi Kawabe ◽  
Yuuta Kobayashi ◽  
Setsuo Tsuruta ◽  
Yoshitaka Sakurai ◽  
Rainer Knauf

2017 ◽  
Vol 9 ◽  
pp. 184797901774360 ◽  
Author(s):  
Anna Maria Sri Asih ◽  
Bertha Maya Sopha ◽  
Gilang Kriptaniadewa

Many existing studies have used hypothetical data to evaluate the performance of various metaheuristics in solving delivery route optimization. As empirical data impose characteristics of a particular problem, it is necessary to evaluate whether the problem characteristics may influence to the performance of metaheuristics. This article therefore attempts to compare the performance of metaheuristics, that is, genetic algorithm, ant colony optimization (ACO), particle swarm optimization, and simulated annealing (SA), to solve an empirical delivery problem in Yogyakarta, Indonesia. Two cases are developed to capture different characteristics of empirical data. The first case introduces delivery problem of one logistics operator and 58 retailers; the second case presents collaborative strategy in delivery problem, involving two logistics operators and 142 retailers. Results indicate that ACO and SA perform better with respect to less distance traveled for both cases and higher truck utility and lower number of routes for the second case.


2020 ◽  
Vol 2020 ◽  
pp. 1-16
Author(s):  
Guofeng Sun ◽  
Zhiqiang Tian ◽  
Renhua Liu ◽  
Yun Jing ◽  
Yawen Ma

This paper studies the take-out route delivery problem (TRDP) with order allocation and unilateral soft time window constraints. The TRDP considers the order allocation and delivery route optimization in the delivery service process. The TRDP is a challenging version of vehicle routing problem. In order to solve this problem, this paper aims to minimize the total cost of delivery, builds an optimization model of this problem by using cumulative time, and adds time dimension in order allocation and path optimization dimensions. It can not only track the real-time location of delivery personnel but also record the delivery personnel to perform a certain task. The main algorithm is the dynamic allocation algorithm designed from the perspective of dispatch efficiency, and the subalgorithm is the improved genetic algorithm. Finally, some experiments are designed to verify the effectiveness of the established model and the designed algorithm, the order allocation and route optimization are calculated with/without the consideration of traffic jam, and the results show that the algorithm can generate better solution in each scene.


2020 ◽  
Vol 836 ◽  
pp. 42-52
Author(s):  
Chuanwen Luo ◽  
Deying Li ◽  
Xingjian Ding ◽  
Weili Wu

Sign in / Sign up

Export Citation Format

Share Document