19 Hits in 8.4 sec

Scatter Search and Path-Relinking: Fundamentals, Advances, and Applications [chapter]

Mauricio G.C. Resende, Celso C. Ribeiro, Fred Glover, Rafael Martí
2010 International Series in Operations Research and Management Science  
We describe its mechanics, implementation issues, randomization, the use of pools of high-quality solutions to hybridize path-relinking with other heuristic methods, and evolutionary path-relinking.  ...  We also describe the hybridization of path-relinking with genetic algorithms to implement a progressive crossover operator.  ...  There is also a third source, which is frequently updated with current applications: the web site on scatter search and path-relinking publications, in which more  ... 
doi:10.1007/978-1-4419-1665-5_4 fatcat:r2uzmou55ngnfjph5mlepnfl2y

A template for scatter search and path relinking [chapter]

Fred Glover
1998 Lecture Notes in Computer Science  
We identify a template for scatter search and path relinking methods that provides a convenient and "user friendly" basis for their implementation.  ...  Scatter search and its generalized form called path relinking are evolutionary methods that have recently been shown to yield promising outcomes for solving combinatorial and nonlinear optimization problems  ...  in scatter search and path relinking.  ... 
doi:10.1007/bfb0026589 fatcat:lcdtds7qqrfkzfe4gnzlchynhe

A survey on optimization metaheuristics

Ilhem Boussaïd, Julien Lepagnot, Patrick Siarry
2013 Information Sciences  
Trajectory methods mainly encompass the simulated annealing method, the tabu search, the GRASP method, the variable neighborho od search, the guided local search, the iterated local search, and their variants  ...  , the variable neighborhood search, the guided local search, the iterated local search, and their variants.  ...  The research community, the number of sessions, workshops, and conferences dealing with metaheurist ics is growing significantly.  ... 
doi:10.1016/j.ins.2013.02.041 fatcat:osz7frllkrfqfke4crydwr4pe4

A comparative study of labeling algorithms within the branch-and-price framework for vehicle routing with time windows

Stefano Michelini
2019 4OR  
Then, we search for good parameter configurations for each algorithm with a tool for automated parameter tuning.  ...  Branch-and-Price (BP) is one of the most effective and commonly used exact methodologies for solving routing problems.  ...  For instance, Ioachim et al. (1998) develop a dynamic programming algorithm for the shortest path problem with time windows and linear node costs, which includes as a special case the shortest path problem  ... 
doi:10.1007/s10288-018-0396-0 fatcat:en5vtuyrz5golayvqkzpij56em

Solving the High School Scheduling Problem Modelled with Constraints Satisfaction Using Hybrid Heuristic Algorithms [chapter]

Ivan Chorbev, Suzana Loskovska, Ivica Dimitrovski, Dragan Mihajlov
2008 Greedy Algorithms  
Also, constraint optimization problems can be defined as constraint satisfaction problems upgraded with several local cost functions.  ...  , Greedy Randomized Adaptive Search Procedure -GRASP etc.  ... 
doi:10.5772/6118 fatcat:6u4c2mbjyjc4vhk6y2xozy6u34

Optimization methods applied to renewable and sustainable energy: A review

R. Baños, F. Manzano-Agugliaro, F.G. Montoya, C. Gil, A. Alcayde, J. Gómez
2011 Renewable & Sustainable Energy Reviews  
Fortunately, the continuous advances in computer hardware and software are allowing researchers to deal with these optimization problems using computational resources, as can be seen in the large number  ...  Energy is a vital input for social and economic development.  ...  The main population-based meta-heuristics include: genetic algorithms (GA) and evolutionary algorithms (EA), scatter search (SS), path relinking (PR), memetic algorithms (MA), ant colony optimization (  ... 
doi:10.1016/j.rser.2010.12.008 fatcat:itg2ykeigffx5jl55hn5buqdvu

The Vessel Schedule Recovery Problem (VSRP) – A MIP model for handling disruptions in liner shipping

Berit D. Brouer, Jakob Dirksen, David Pisinger, Christian E.M. Plum, Bo Vaaben
2013 European Journal of Operational Research  
, and the travel paths for users between each pair of origins and destinations.  ...  Multi-objective (MO) route selection problem is a combination of two combinatorial problems: MO shortest path problem (finding the efficient paths between the nodes to be visited) and MO traveling salesperson  ...  In the second phase, more solutions are found either through an iterative process that combines path-relinking and local search or a GRASP ruin-and-recreate algorithm.  ... 
doi:10.1016/j.ejor.2012.08.016 fatcat:c27kagfnxnhjfbil2rydhjhomm

Environmentally conscious manufacturing and product recovery (ECMPRO): A review of the state of the art

Mehmet Ali Ilgin, Surendra M. Gupta
2010 Journal of Environmental Management  
Finally, we conclude by summarizing the evolution of ECMPRO over the past decade together with the avenues for future research.  ...  In this paper we primarily discuss the evolution of ECMPRO that has taken place in the last decade and discuss the new areas that have come into focus during this time.  ...  Adenso-Diaz et al. (2008) propose a GRASP and path-relinking-based heuristic methodology to solve a bi-criteria disassembly planning problem.  ... 
doi:10.1016/j.jenvman.2009.09.037 pmid:19853369 fatcat:2c7cc2wowjaahdemy2rnz7gana

Occlusion Detection and Index-based Ear Recognition

Madeena Sultana, Padma Polash Paul, Marina Gavrilova
2015 Journal of WSCG  
An international journal of algorithms, data structures and techniques for computer graphics and visualization, surface meshing and modeling, global illumination, computer vision, image processing and  ...  pattern recognition, computational geometry, visual human interaction and virtual reality, animation, multimedia systems and applications in parallel, distributed and mobile environment.  ...  Authors thank Biwei Huang for help with data segmentation and animation.  ... 
dblp:journals/jwscg/SultanaPG15 fatcat:uisp4vxs2vecrpjyy6cugbd2oa

Innovative Hybrid Approaches for Vehicle Routing Problems

Luca Accorsi
Solution of Vehicle Routing Problems 3 Cordeau, Gendreau, and Laporte (1997)) and the Location Routing Problem (LRP, Schneider and Drexl (2017)), can be modeled within this framework.  ...  This work has been done in collaboration with my supervisor prof. Daniele Vigo and prof.  ...  Michele Lombardi for sharing with me ideas and possible interesting research paths.  ... 
doi:10.48676/unibo/amsdottorato/10048 fatcat:s7zbkuplzbchjblhfd2mujymiy

Models and Algorithms for the Optimization of Real-World Routing and Logistics Problems

Consorzio Spinner, Stefano Coordinatore, Dottorato Supervisore, Daniele, Iori Manuel, Daniele Supervisore, Vigo
Among those, we define the problem related to the tool path definition in the 3DP process, the 3D Routing Problem (3DRP), which is a generalization of the arc routing problem.  ...  Logistics and transportation aspects are very important and represent a relevant costs for producing and shipping companies, but also for public administration and private citizens.  ...  Acknowledgments We thank the Mobility Concilorship of Reggio Emilia, and Alessandro Meggiato, Mobility Manager of the Municipality of Reggio Emilia, for the data and information supplied.  ... 


La Habana
It is built upon the well known metaheuristic GRASP and strengthened with an inclusion of specific local search components.  ...  We propose an improved GRASP strategy using in each iteration Simulated Annealing as local search.  ... 

Solving transportation scheduling problems : models and algorithms [article]

Yutian Yang
Using this cost evaluator, we develop four local search based heuristic algorithms to sequentially improve crew scheduling decisions under uncertainty.  ...  This dissertation addresses crew scheduling in freight railways and vehicle routing problems (VRP) for mail processing and distribution centers (P&DCs).  ...  In a post-processing step, path relinking is applied to the pool members to cyclically generate paths between each pair with the expectation of uncovering improved solutions.  ... 
doi:10.15781/t2f47gt91 fatcat:nf575gckujcutl7ojuf4en3tje

Tactical Problems in Vehicle Routing Applications [article]

Francesco Bertoli, University, The Australian National, University, The Australian National
On the other side, the composition of the fleet strongly influences the daily plans, and therefore costs such as fuel or drivers' wages.  ...  Tactical problems are of a fundamental importance as they directly influence the daily operations, and therefore a part of the incurred costs, for a long time.  ...  Local Search and Large Neighbourhood Search As already stated, local search-based algorithms explore the solution space by moving from one solution to another.  ... 
doi:10.25911/5d65134612220 fatcat:aunuiz65m5ec7erwztd2dxldpu

Seismic soil-structure interaction with finite elements and the method of substructures [article]

George Stavroulakis, National Technological University Of Athens, National Technological University Of Athens
This Thesis deals with all of the above problems with the aim to provide a computational toolbox for addressing the solution of this complicated problem and is organized as follows: Chapter 1 is an introduction  ...  Chapter 4 is dedicated to solution algorithms for solving problems described in the previous chapters and suggests novel and computationally efficient methods for the solution of both porous media and  ...  Acknowledgements First, I would like to thank my advisor, Professor Manolis Papadrakakis, for his spirit, vision, patience and scientific guidance throughout the years, starting from my graduate studies  ... 
doi:10.26240/heal.ntua.1291 fatcat:o5ge43yd5zgula2fizmusxl4mi
« Previous Showing results 1 — 15 out of 19 results