research-article

Algorithm Design for Solving VRPTW Problem in Supermarket Chain Distribution

Authors:

Yaqiang Sun,

Ailing ChenAuthors Info & Claims

IMMS '21: Proceedings of the 4th International Conference on Information Management and Management Science

Pages 71 - 75

https://doi.org/10.1145/3485190.3485202

Published: 02 December 2021 Publication History

Get Access

Abstract

In recent years, the scale of supermarket chain in China is constantly expanding, fast and accurate distribution mode is very important for the development of supermarket chain. The vehicle routing problem with time windows (VRPTW) is an important problem in the distribution management of supermarket chain. Genetic algorithm (GA) is widely used to solve vehicle routing problem. This paper establishes a mathematical model of VRPTW for the distribution problem of supermarket chain. We design a developed genetic algorithm and introduce a penalty function into the fitness function. Through a case, we use the developed algorithm to solve the problem and rearrange the routes. We also compare the results of the developed genetic algorithm and simulated annealing algorithm. The comparison results show the efficiency of the algorithm.

References

[1]

Li Xiaoling. Research on Optimization of Chain Supermarket Distribution Route Based on Improved Genetic Algorithm [J]. Gansu Science Journal, 2020, v.32;No.148(06):150-154.

Google Scholar

[2]

ZHENG Yibin, QIU Xingyu, SUN Yuanze. Research on Optimization of Cold Chain Logistics Distribution Path Based on Genetic Algorithm [J]. Highway & Automotive Transportation, 2020,000(003):49-52.

Google Scholar

[3]

Amorim P, Parragh S N, Sperandio F, A rich vehicle routing problem dealing with perishable food: a case study[J]. TOP, 2014, 22(2):489-50.

Crossref

Google Scholar

[4]

Zhang Yunqi. Research on Distribution Management Strategy of China Resources Wanjia Chain Supermarket [J]. Rural Family Counsellor,2020(23).

Google Scholar

[5]

ZHOU Qisen. Review of Algorithms for Vehicle Routing Problem [J]. Gansu Science and Technology Review,2020(8).

Google Scholar

[6]

Ibrahim M F Optimised Genetic Algorithm Crossover and Mutation Stage for Vehicle Routing Problem Pick-Up and Delivery with Time Windows[J]. IOP Conference Series: Materials Science and Engineering, 2021, 1071(1): 012025.

Google Scholar

[7]

He Guoqiang. Two-population Hybrid Genetic Algorithm for Vehicle Routing Problem in Logistics Distribution [D]. Lanzhou Jiaotong University, 2020.

Google Scholar

[8]

José Ruiz-Meza VRP Model with Time Window, Multiproduct and Multidepot [J]. Journal of Applied Science and Engineering, 2020, 23(2): 239-247

Google Scholar

[9]

Moon I K, Lee J H, Seong J. Vehicle routing problem with time windows considering overtime and outsourcing vehicles[J]. Expert Systems with Applications, 2012, 39(18):13202–13213.

Digital Library

Google Scholar

[10]

Furian N, O'Sullivan M, Walker C, A machine learning-based branch and price algorithm for a sampled vehicle routing problem[J]. OR Spectrum, 2021(1).

Google Scholar

Cited By

View all

Wen HLin YWu FWan HSun ZCai TLiu HGuo SZheng JSong CWu L(2023)Enough Waiting for the Couriers: Learning to Estimate Package Pick-up Arrival Time from Couriers’ Spatial-Temporal BehaviorsACM Transactions on Intelligent Systems and Technology10.1145/358256114:3(1-22)Online publication date: 13-Apr-2023
https://dl.acm.org/doi/10.1145/3582561

Index Terms

Algorithm Design for Solving VRPTW Problem in Supermarket Chain Distribution

Index terms have been assigned to the content through auto-classification.

Recommendations

Solving the Graph Planarization Problem Using an Improved Genetic Algorithm

An improved genetic algorithm for solving the graph planarization problem is presented. The improved genetic algorithm which is designed to embed a graph on a plane, performs crossover and mutation conditionally instead of probability. The improved ...
Solving Japanese nonograms by Taguchi-based genetic algorithm

A Taguchi-based genetic algorithm (TBGA) is proposed to solve Japanese nonogram puzzles. The TBGA exploits the power of global exploration inherent in the traditional genetic algorithm (GA) and the abilities of the Taguchi method in efficiently ...
An improved genetic algorithm with conditional genetic operators and its application to set-covering problem

The genetic algorithm (GA) is a popular, biologically inspired optimization method. However, in the GA there is no rule of thumb to design the GA operators and select GA parameters. Instead, trial-and-error has to be applied. In this paper we present an ...

Comments

Information & Contributors

Information

Published In

IMMS '21: Proceedings of the 4th International Conference on Information Management and Management Science

August 2021

332 pages

ISBN:9781450384278

DOI:10.1145/3485190

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 02 December 2021

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed limited

Conference

IMMS 2021

IMMS 2021: 2021 4th International Conference on Information Management and Management Science

August 27 - 29, 2021

Chengdu, China

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
80
Total Downloads

Downloads (Last 12 months)10
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Wen HLin YWu FWan HSun ZCai TLiu HGuo SZheng JSong CWu L(2023)Enough Waiting for the Couriers: Learning to Estimate Package Pick-up Arrival Time from Couriers’ Spatial-Temporal BehaviorsACM Transactions on Intelligent Systems and Technology10.1145/358256114:3(1-22)Online publication date: 13-Apr-2023
https://dl.acm.org/doi/10.1145/3582561

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

HTML Format

View this article in HTML Format.

HTML Format

Abstract

References

Cited By

Index Terms

Recommendations

Solving the Graph Planarization Problem Using an Improved Genetic Algorithm

Solving Japanese nonograms by Taguchi-based genetic algorithm

An improved genetic algorithm with conditional genetic operators and its application to set-covering problem

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

HTML Format

Share

Share this Publication link

Share on social media

Affiliations