1,877 Hits in 7.6 sec

Multi Objective Vehicle Routing Problem: A Survey

Sandhya ., Rajeev Goel
2018 Asian Journal of Computer Science and Technology  
In the last decades, a lot of research has been done on Multi Objective Vehicle Routing due to its rich real life applications. However, the related literature is yet not being summarized anywhere.  ...  This paper presents a broad survey on the considered problem. This paper broadly presents the objectives considered, approaches used to solve multi objective vehicle routing problem.  ...  Multi Objective Vehicle Routing Problem: A Survey  ... 
doi:10.51983/ajcst-2018.7.3.1903 fatcat:2nn7cgen6bdabpxxddhrljejd4

An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows

Abel Garcia-Najera, John A. Bullinaria
2011 Computers & Operations Research  
Its main objective is to find the lowest distance set of routes to deliver goods, using a fleet of identical vehicles with restricted capacity, to customers with service time windows.  ...  This paper proposes and analyzes a novel multi-objective evolutionary algorithm, which incorporates methods for measuring the similarity of solutions, to solve the multi-objective problem.  ...  Multi-objective performance comparisons To evaluate the performance of our MOEA as a multiobjective approach, NSGA-II [12] was implemented for comparison purposes, and the multi-objective performance  ... 
doi:10.1016/j.cor.2010.05.004 fatcat:ssyrn6v3ufdlzezjkfxiq3txw4

Multi-strategy ensemble evolutionary algorithm for dynamic multi-objective optimization

Yu Wang, Bin Li
2009 Memetic Computing  
However, few studies have been reported on dynamic multi-objective optimization (dMO) and scarce effective dMO methods have been proposed.  ...  A new multi-strategy ensemble multi-objective evolutionary algorithm (MS-MOEA) is proposed to tackle the challenges of dMO.  ...  Another example of dynamic multi-objective problem is the routing of vehicles. people always want to get to the target with the shortest transport time and the least transport cost.  ... 
doi:10.1007/s12293-009-0012-0 fatcat:d63stmsbwrdh5mtbgvdudy3jb4

State-of-the Art Review—Evolutionary Algorithms for Vehicle Routing

Jean-Yves Potvin
2009 INFORMS journal on computing  
This paper is a survey of the literature on applications of evolutionary algorithms for vehicle routing problems.  ...  The performance of evolutionary algorithms is also compared with the best alternative problem-solving approaches on benchmark instances.  ...  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

A Parallel Memetic Algorithm to Solve the Capacitated Vehicle Routing Problem with Time Windows

Oscar M. Gonzalez, Carlos Segura, Sergio Ivvan Valdez Peña
2018 International Journal of Combinatorial Optimization Problems and Informatics  
A new best-known solution for a commonly used instance could be generated.  ...  A common challenge is to find the optimal route, or routes, to attend demands of customers of a store. This challenge is known as the Vehicle Routing Problem (VRP).  ...  A more complex memetic algorithm is used in [15] for approaching a multi-objective version of the CVRPTW to minimize the traveling distance and the number of routes at the same time.  ... 
dblp:journals/ijcopi/GonzalezSP18 fatcat:s3axjuwaujgq7mb5pcbomi3ebi

Evolutionary computation for dynamic optimization problems

Shengxiang Yang
2013 Proceeding of the fifteenth annual conference companion on Genetic and evolutionary computation conference companion - GECCO '13 Companion  
20 / 63 Dynamic Permutation Benchmark Generator The dynamic benchmark generator for permutation-encoded problems (DBGP) can create a DOP from any stationary TSP/VRP by swapping objects: 1 Generate a random  ...  IEEE Trans SMC Part C: Appl. & Rev., 40(1): 52-63 Shengxiang Yang (De Montfort University) Tutorial: EC for DOPs GECCO'13, 7/7/2013 50 / 63 Case Study: Dynamic Vehicle Routing -1 The basic Vehicle Routing  ... 
doi:10.1145/2464576.2480805 dblp:conf/gecco/Yang13 fatcat:xclfconlyfh2zh4fr2jwczthmy

On optimizing a demand responsive transport with an evolutionary multi-objective approach

Remy Chevrier, Arnaud Liefooghe, Laetitia Jourdan, Clarisse Dhaenens
2010 13th International IEEE Conference on Intelligent Transportation Systems  
Such mechanisms are used with three state-of-the-art multi-objective evolutionary algorithms: NSGA-II, IBEA and SPEA2.  ...  The approach is assessed by applying the algorithms to both random and realistic dial-aride instances.  ...  ACKNOWLEDGMENT The authors would like to thank the anonymous reviewers for their contribution and their relevant remarks.  ... 
doi:10.1109/itsc.2010.5625025 dblp:conf/itsc/ChevrierLJD10 fatcat:iwhxakfw6vdcfeepfpawgppbpm

Hybrid Metaheuristics for the Vehicle Routing Problem with Stochastic Demands

Leonora Bianchi, Mauro Birattari, Marco Chiarandini, Max Manfrin, Monaldo Mastrolilli, Luis Paquete, Olivia Rossi-Doria, Tommaso Schiavinotto
2005 Journal of Mathematical Modelling and Algorithms  
This article analyses the performance of metaheuristics on the Vehicle Routing Problem with Stochastic Demands.  ...  Here, we explore the hybridization of the metaheuristic search process by interleaving the objective function with the one from a closely related problem (the traveling salesman problem) which can be computed  ...  The EC is not responsible for any use that might be made of data appearing in this publication.  ... 
doi:10.1007/s10852-005-9033-y fatcat:tdokxr4ew5h27amc4m5igkrf5a

A Multi-Agent System based on the Multi-Objective Simulated Annealing Algorithm for the Static Dial a Ride Problem

Issam ZIDI, Kamel ZIDI, Khaled MESGHOUNI, Khaled GHEDIRA
2011 IFAC Proceedings Volumes  
Tests show competitive results on (Cordeau and Laporte, 2003) benchmark datasets while improving processing times to obtain a pareto solution for the problem in concern.  ...  In this work, we offer our contribution to the study and solving the DRP in the application using a multi agent system based on the Multi-Objective Simulated Annealing Algorithm.  ...  Indeed, in this benchmark, we find 20 instances of DRP. These instances are diversified by the number of transport requests and the number of vehicles.  ... 
doi:10.3182/20110828-6-it-1002.02639 fatcat:iqcn4wamajbgdbjkn4ap5ndvpm

Comparison of similarity measures for the multi-objective vehicle routing problem with time windows

Abel Garcia-Najera, John A. Bullinaria
2009 Proceedings of the 11th Annual conference on Genetic and evolutionary computation - GECCO '09  
Its main objective is to find the lowest-distance set of routes to deliver goods to customers, which have service time windows, using a fleet of identical vehicles with restricted capacity.  ...  The Vehicle Routing Problem can be seen as a fusion of two well known combinatorial problems, the Travelling Salesman Problem and Bin Packing Problem.  ...  EVOLUTIONARY ALGORITHM FOR SOLVING THE VRPTW We present in this section our proposed EA for solving the VRPTW as a multi-objective problem.  ... 
doi:10.1145/1569901.1569982 dblp:conf/gecco/Garcia-NajeraB09 fatcat:764zdwuk45hqrjfdetkzfjwgwm

A Literature Survey on Offline Automatic Algorithm Configuration

Yasemin Eryoldaş, Alptekin Durmuşoglu
2022 Applied Sciences  
Moreover, some recommendations and possible future directions for this topic are provided as a conclusion.  ...  Although there is very wide literature about algorithm configuration problems, a detailed survey analysis has not been conducted yet to the best of our knowledge.  ...  Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/app12136316 fatcat:gvv66r55xvcjbjvf4re5wlacvu

A Survey on Multi Objective Optimization Challenges in Swarm Intelligence

Rich Caruana, Yin Lou
2021 Journal of Computing and Natural Science  
Various challenges in real life are multi-objective and conflicting (i.e., alter concurrent optimization). This implies that a single objective is optimized based on another's cost.  ...  The main purpose of this contribution is to present a basis of understanding on MOO challenges.  ...  Concurrent variants of the Vector Evaluated PSO (VEPSO) algorithm for multi-objective scenarios have been evaluated on frequently used test cases.  ... 
doi:10.53759/181x/jcns202101018 fatcat:akpp2yudgbc5lew4v74h3ud2mm

An Evolutionary Approach to Capacitated Resource Distribution by a Multiple-Agent Team [chapter]

Mudassar Hussain, Bahram Kimiaghalam, Abdollah Homaifar, Albert Esterline, Bijan Sayyarodsari
2003 Lecture Notes in Computer Science  
In this paper a central planner is responsible for planning routes and schedules for the entire team of cooperating robots.  ...  The algorithm was tested on a set of standard problems with encouraging results.  ...  The end product will be a good robust algorithm for logistics problems with spatial and temporal as well as precedence constraints.  ... 
doi:10.1007/3-540-45105-6_81 fatcat:7w3i546qkna4ze5eg5q3gl5cra

A survey of swarm intelligence for dynamic optimization: Algorithms and applications

Michalis Mavrovouniotis, Changhe Li, Shengxiang Yang
2017 Swarm and Evolutionary Computation  
This paper presents a broad review on SI dynamic optimization (SIDO) focused on several classes of problems, such as discrete, continuous, constrained, multi-objective and classification problems, and  ...  For such dynamic optimization problems (DOPs), it is difficult for a conventional SI algorithm to track the changing optimum once the algorithm has converged on a solution.  ...  OR "time-varying" OR "dynamic problem" OR "dynamic routing" OR "dynamic scheduling" OR "dynamic multi-objective" OR "dynamic constraint") for ACO.  ... 
doi:10.1016/j.swevo.2016.12.005 fatcat:ro3x4hds5vc7ri42szwdhby3bq

Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs

Laura Calvet, Jésica de Armas, David Masip, Angel A. Juan
2017 Open Mathematics  
For instance, a consumer's willingness to spend on a specific product might change as the availability of this product decreases and its price rises.  ...  AbstractThis paper reviews the existing literature on the combination of metaheuristics with machine learning methods and then introduces the concept of learnheuristics, a novel type of hybrid algorithms  ...  Likewise, we want to thank the support of the UOC doctoral programme.  ... 
doi:10.1515/math-2017-0029 fatcat:ktigbziemvel3a5mpxjfz6dsra
« Previous Showing results 1 — 15 out of 1,877 results