Analysis of an Automated Vehicle Routing Problem in Logistics considering Path Interruption

Zhang, Yong; Shi, Lei; Chen, Jing; Li, Xuefeng

doi:10.1155/2017/1624328

Cited by 9 publications

(7 citation statements)

References 37 publications

(47 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Routing Electric vehicle routing [87,91,92]; routing with drones [94,99];routing with time windows [10,93]; multimodal delivery [89]; crowd navigation [85]; automated vehicle routing [84]; routing with lunch breaks [90]; other routing problems [83,86,95] 14…”

Section: Operational Optimization 21mentioning

confidence: 99%

Framework of Last Mile Logistics Research: A Systematic Review of the Literature

2019

View full text Add to dashboard Cite

Coincident with the rapid growth of omni-channel retailing, growing urbanization, changing consumer behavior, and increasing focus on sustainability, academic interest in the area of last mile logistics has significantly increased. The growth in academic publications has been tremendous, with three out of four articles appearing within the past five years. The influx of research spans multiple disciplines and various methodologies, underlining the complexity and fragmentation of last mile logistics research, which leads to a lack of unity in the understanding of the concept. We provide a systematic review and classification of the literature to provide a more coherent view of last mile logistics research. The review covers 155 peer-reviewed journal publications focusing on last mile logistics. Findings demonstrate that the literature embraces a diversity of aspects and facets that are classified into five themes: emerging trends and technologies, operational optimization, supply chain structures, performance measurement, and policy. Further, we propose a framework of last mile logistics literature that comprises five components and their interrelationships, namely, last mile logistics, last mile distribution, last mile fulfillment, last mile transport, and last mile delivery. The results provide a foundation for further development of this research area by proposing avenues for future research.

show abstract

Section: Operational Optimization 21mentioning

confidence: 99%

Framework of Last Mile Logistics Research: A Systematic Review of the Literature

2019

View full text Add to dashboard Cite

show abstract

“…A kettő között az a alapvető különbség, hogy a termelésprogramozás időegység alapú és rendezés nélküli, míg a termelésütemezés folytonos időábrázolást használ és sorrendezést készít el. Tehát a kiterjedt logisztikai hálózat és a keresleti csomópontok stabilabbá teszik az LPDI (Logistics providers concerned with integrated delivery and installation) és az LLP (Local Logistics Provider) közötti együttműködési kapcsolatot, vagyis a hosszú távú együttműködést részesítik előnyben [10].…”

Section: áBra Késztermék Kezelésének Logisztikai Feladatai [Saját Szunclassified

Késztermékek kezeléseinek optimálhatósági vizsgálata

Juhász

2020

MDT

View full text Add to dashboard Cite

Jelen cikkem a Logisztika 4.0 prosperáló hatására a belső vállalati logisztikai folyamatokkal foglalkozik, hiszen a teljes ellátási lánc eredményes és korszerű fenntartása kiemelt logisztikai feladat. A kutatásom egy fiktív bázisvállalat késztermékeinek kiszerelési tevékenységeit elemzi annak érdekében, hogy a folyamatok intenzifikálhatóak legyenek. Kiemelten foglalkozom a lehetséges egységrakományképzési, csomagolási, tárolási és árukiadási folyamatokkal, valamint ezek kapacitásaival. A cikk célja az, hogy alternatív megoldásokat mutassak be az árukiadás belső folyamatainak áteresztő képességének javítására és az azonosított szűk keresztmetszetek feloldására. A bemutatott matematikai modell segítségével lehetővé válik a meglévő erőforrások optimális allokációja a jelenlegi logisztikai terület hatékony üzemeltetésére.

show abstract

“…6-the study of (Young Zhang & et al,2017). A study on the analysis of the problem of automatic vehicle routing in the field of logistics, taking into account the obstacles of the tracks, where they addressed the application of the use of vehicles in the field of logistics and the possibility of contributing to reduce the cost effectively through the logistics and reduce the potential risks in the reduction of tracks where the model was modified known to the vehicle routing problem and the use of the Particle Swarm algorithm after adding improvements on the basis of the proposed model.…”

Section: Reference Review:-mentioning

confidence: 99%

“…It is concerned with finding the best set of tracks for vehicles that reduce the distance of the total trip when a group of vehicles starts from a central warehouse that does not deliver a quantity of goods to a group of customers or points that request them. Goods and in specific vehicle capacities and then return these vehicles to the starting point where the framework for solving this problem is to comply with the following restrictions [25]:…”

Section: Reference Review:-mentioning

confidence: 99%

Solve the Capacitance Vehicle Routing Problem ( Cvrp) Using the Tabu Search Algorithm (Ts) and the Particle Swarm Optimization With Practical Application.

Bakhit¹,

noori²

2018

IJAR

View full text Add to dashboard Cite

Capacitated vehicle routing problem (CVRP), tabu search (TS) ,particle swarm optimization(PSO).In this paper we examine the vehicle routing problem (VRP) which is classified as a problem (NP-HARD). This problem addresses the design of tracks for a group of vehicles that equip a number of customers deployed in different locations. The objective of this problem is to reduce the total cost of delivery, taking into account the limitations of the problem, and also to design the optimal distribution of the tracks within the specified vehicle capacity limits. The study includes the most important methods used to solve the problem, the use of the tabu search algorithm (TS) and particle swarm optimization(pso) and the hybridization of a new algorithm that adopts the characteristics of tabu search with particle swarm optimization ( TS-PSO) in solving problem Issues. The performance and efficiency of the algorithms are compared by solving known issues of the problem. The results show that the tabu search algorithm (TS) is efficient in finding solutions to the problem. The ability to reach the mean deviation about (1.764) from the standard solutions for the set of standard issues. However, the TS-PSO is able to produce results that overcame the results of the tabu search algorithm as well as the particle swarm algorithm, although the hybrid algorithm requires double and large computational times compared to the two individually designed algorithms. The method of the problem has been applied in the General Company for the manufacture of grain distribution process from one of the mills to a group of agents deployed geographically The method was able to reach to draw and design the best possible paths for vehicles available at the least distance cut and the lowest number of vehicles. …………………………………………………………………………………………………….... Introduction:-The field of transport and logistics services has become an important basis for the management and supply of goods and services in distribution systems and for a large number of real-world applications where institutions and commercial centers have begun to adopt procedures and systems that adopt planning in the management of logistics transport and Which will help in the effective changes in the reduction of the total costs. In fact, the transfer process represents a large proportion of the costs usually in addition to the cost of goods and services and the process of

show abstract

Analysis of an Automated Vehicle Routing Problem in Logistics considering Path Interruption

Cited by 9 publications

References 37 publications

Framework of Last Mile Logistics Research: A Systematic Review of the Literature

Framework of Last Mile Logistics Research: A Systematic Review of the Literature

Késztermékek kezeléseinek optimálhatósági vizsgálata

Solve the Capacitance Vehicle Routing Problem ( Cvrp) Using the Tabu Search Algorithm (Ts) and the Particle Swarm Optimization With Practical Application.

Contact Info

Product

Resources

About