A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Filters
Exploring Feasible and Infeasible Regions in the Vehicle Routing Problem with Time Windows Using a Multi-objective Particle Swarm Optimization Approach
[chapter]
2009
Studies in Computational Intelligence
This paper investigates the ability of a discrete particle swarm optimization algorithm (DPSO) to evolve solutions from infeasibility to feasibility for the Vehicle Routing Problem with Time Windows (VRPTW ...
The proposed algorithm incorporates some principles from multi-objective optimization to allow particles to conduct a dynamic trade-off between objectives in order to reach feasibility. ...
Acknowledgements This work has been partially funded by the projects TIN-2005-08404-C04-03 and TIN2008-06872-C04-01/TIN of the Spanish Government. ...
doi:10.1007/978-3-642-03211-0_9
fatcat:szn6kw4vnvd7tg32thuok33y2y
A Survey on the Electric Vehicle Routing Problem: Variants and Solution Approaches
2019
Journal of Advanced Transportation
Several variants of the E-VRP and related problems are observed. To cope with the new routing challenges in E-VRP, efficient VRP heuristics and metaheuristics had to be adapted. ...
The well-researched vehicle routing problem (VRP) is extended to the electric vehicle routing problem (E-VRP), which takes into account specific characteristics of electric vehicles. ...
Acknowledgments The research has been supported by the European Regional Development ...
doi:10.1155/2019/5075671
fatcat:tmslmxzeqvc23e3jaxrpfc54ki
Multi-load AGVs scheduling by application of modified memetic particle swarm optimization algorithm
2018
Journal of the Brazilian Society of Mechanical Sciences and Engineering
The present study proposes a combination of particle swarm optimization (PSO) for global search and memetic algorithm (MA) for local search termed as the modified memetic particle swarm optimization algorithm ...
The newly proposed algorithm is applied for the generation of initial feasible solutions for scheduling of multi-load AGVs with minimum travel and minimum waiting time in the FMS. ...
Acknowledgements The author would like to express his sincere thanks to the editorial team and to the anonymous reviewers for their significant constructive comments for the earlier version of this paper ...
doi:10.1007/s40430-018-1357-4
fatcat:zuomcinwbrh6fl7f7ol4connlq
Sustainable maritime inventory routing problem with time window constraints
2017
Engineering applications of artificial intelligence
Costs associated with the violation of time window helps in maintaining a proper port discipline. ...
Particle Swarm Optimization -Differential Evolution (PSO-DE), Basic PSO and Genetic Algorithm (GA) are used to validate the result obtained from PSO-CP. ...
Zhu et al. 2009 employed a particle swarm optimization algorithm for resolving a complex vehicle routing problem in the domain of grain logistics. ...
doi:10.1016/j.engappai.2017.02.012
fatcat:i3baovoqqjarzgg4b7dfsm2734
State-of-the Art Review—Evolutionary Algorithms for Vehicle Routing
2009
INFORMS journal on computing
It reports about genetic algorithms, evolution strategies and particle swarm optimization, when applied to the classical capacitated vehicle routing problem and many of its variants. ...
The Vehicle Routing Problem In the Vehicle Routing Problem (VRP), least-cost delivery or collection routes must be designed for a set of customers, using a fleet of vehicles located at a central depot, ...
Acknowledgments Financial support for this work was provided by the Canadian Natural Sciences and Engineering Research Council (NSERC). This support is gratefully acknowledged. ...
doi:10.1287/ijoc.1080.0312
fatcat:nw5r3y4bhbfqzchcqz4zvxhetm
An attractors-based particle swarm optimization for multiobjective capacitated vehicle routing problem
2021
Reserche operationelle
In this paper, a new multiobjective discrete particle swarm algorithm is presented for the Capacitated vehicle routing problem. ...
The proposed approach is first implemented on a set of well-known benchmarks for single-objective capacitated vehicle routing problems and compared to results underlined in the literature. ...
The authors wish to thank the anonymous referees for their valuable comments that lead us to improve the quality of the present work. ...
doi:10.1051/ro/2021119
fatcat:jaqbji7335f2bejz7pbtc3fon4
Nature-Inspired Metaheuristic Techniques for Combinatorial Optimization Problems: Overview and Recent Advances
2021
Mathematics
annealing, particle swarm optimization, and tabu search. ...
as vehicle routing problems, traveling salesman problems, and supply chain network design problems. ...
Acknowledgments: The authors would like to thank the Center of Graduate Studies of Universiti Teknologi PETRONAS and the YUTP research fund (015LCO-296) for the funding of this research. ...
doi:10.3390/math9202633
fatcat:tk2ymswg4fau3bpx2kxmcmmyoi
Particle Swarm Optimization: A Survey of Historical and Recent Developments with Hybridization Perspectives
2018
Machine Learning and Knowledge Extraction
Particle Swarm Optimization (PSO) is a metaheuristic global optimization paradigm that has gained prominence in the last two decades due to its ease of application in unsupervised, complex multidimensional ...
The canonical particle swarm optimizer is based on the flocking behavior and social co-operation of birds and fish schools and draws heavily from the evolutionary behavior of these organisms. ...
Acknowledgements This work was made possible by the financial and computing support by the Vanderbilt University Department of EECS. ...
doi:10.3390/make1010010
fatcat:ue65xvqyk5hovlzo6gzok524pm
A petrol station replenishment problem: new variant and formulation
2016
Logistics Research
Literally, we call the resulting problem the multi-compartment vehicle routing problem with time windows (MCVRPTW). ...
Abstract One of the most important problems in the petroleum industry is the well-known petrol station replenishment problem with time windows, which calls for the determination of optimal routes by using ...
, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. ...
doi:10.1007/s12159-016-0133-z
fatcat:voad4hedibdpli6f2vdqmyosnu
A Swarm Intelligence Graph-Based Pathfinding Algorithm Based on Fuzzy Logic (SIGPAF): A Case Study on Unmanned Surface Vehicle Multi-Objective Path Planning
2021
Journal of Marine Science and Engineering
Dynamic and complex environments impose the need for multi-objective path planning where an optimal path should be found to satisfy contradicting objective terms. ...
Advances in robotic motion and computer vision have contributed to the increased use of automated and unmanned vehicles in complex and dynamic environments for various applications. ...
OPTINET has been co-financed by the European Regional Development Fund of the European Union and Greek national funds through the Operational Program Competitiveness, Entrepreneurship and Innovation, under ...
doi:10.3390/jmse9111243
fatcat:i2cia4q3jjhurnxwaao6vgavaq
Swarm intelligence systems for transportation engineering: Principles and applications
2008
Transportation Research Part C: Emerging Technologies
The ACO applications to traffic and transportation engineering problems are given in Section 4. The particle swarm optimization (PSO) is analyzed in Section 5. ...
The "explosion" in such processes is regulated by a certain restraint mechanism. In the ant case, the pheromone trail evaporates with time. ...
Acknowledgments The author would like to thank the anonymous referees whose comments and suggestions have significantly improved this article. ...
doi:10.1016/j.trc.2008.03.002
fatcat:lbif2caiqbhk5l3stfxk5yd2iu
The stochastic vehicle routing problem, a literature review, part I: models
2016
EURO Journal on Transportation and Logistics
Building on the work of Gendreau, Laporte, and Seguin (1996), we review the past 20 years of scientific literature on stochastic vehicle routing problems (SVRP). ...
The numerous variants of the problem that have been studied in the literature are described and categorized. Also a thorough review of solution methods applied to the SVRP is included as an Appendix. ...
A multi-objective approach to the CVRP with soft time windows and stochastic travel times (SCVRPSTW) is found in Russell and Urban (2008) . ...
doi:10.1007/s13676-016-0100-5
fatcat:4ap6cxp2cjdyrgohcjs7tpy55a
Swarm Intelligence in Multiple and Many Objectives Optimization: A Survey and Topical Study on EEG Signal Analysis
[chapter]
2015
Studies in Computational Intelligence
This paper systematically presents the Swarm Intelligence (SI) methods for optimization of multiple and many objective problems. ...
The three forefront swarm intelligence methods, i.e., Ant Colony Optimization (ACO), Particle Swarm Optimization (PSO), and Artificial Bee Colony Optimization (ABC) has been deeply studied to understand ...
[54] proposed a MOACO for handling vehicle routing problem with time window, in this they used the rank based approach with respect to the objectives, the MOACO is known as MACS-VRPTW. ...
doi:10.1007/978-3-662-46309-3_2
fatcat:j3cgruamfzbfljgqu5gdpahloa
A comprehensive survey: Applications of multi-objective particle swarm optimization (MOPSO) algorithm
2013
Transactions on Combinatorics
Particle Swarm Optimization (PSO) has been established in 1995 and became a very mature and most popular domain in SI. ...
Numerous problems encountered in real life cannot be actually formulated as a single objective problem; hence the requirement of Multi-Objective Optimization (MOO) had arisen several years ago. ...
We gratefully acknowledge financial support by BTIS-sub DIC (supported by DBT, Govt. of India) to two of us (S.L. and S.S.) and Advanced Bioinformatics Centre (supported by Govt. of Rajasthan) at Birla ...
doaj:d067a695f2874248a87829b843ff1df7
fatcat:l2vav6okc5bcdaci3h2hwoktyy
Dynamic memory memetic algorithm to solve vehicle routing problem with pickup and delivery when simultaneously considering multiple arrival time and traffic congestion constraints
2020
IEEE Access
Naccache et al. consider a multi-pickup and delivery problem with time windows, in which a set of requests is satisfied by a fleet of vehicles [12] . ...
Besides, an iterative Weiszfeld-type algorithm and a particle swarm optimization metaheuristic are proposed. ...
doi:10.1109/access.2020.3023090
fatcat:u7p2k2dtf5gxzh6omw2pfwlzw4
« Previous
Showing results 1 — 15 out of 242 results