Narrow search
Showing 1 - 10 of 1,250
Cover Image
VRP12 (vehicle routing problem with distances one and two) with side constraints
Ceranoglu, Ahmet N.; Duman, Ekrem - In: International Journal of Production Economics 144 (2013) 2, pp. 461-467
The problem undertaken in this study is inspired from a real life application. Consider a vehicle routing problem where the distances between the customer locations are either one or two. We name this problem as VRP12 in an analogy for the name TSP12 used for the traveling salesman problem in...
Persistent link: https://www.econbiz.de/10010678879
Cover Image
A Branch-and-Cut Approach to a Traveling Salesman Problem with Side Constraints
Padberg, M.; Rinaldi, G. - In: Management Science 35 (1989) 11, pp. 1393-1412
A problem posed by O. L. Deutsch (Deutsch, O. L. 1988. Artificial intelligence design challenge---Background, analysis, and relative performance of algorithms. J. Guidance, Control, and Dynamics 11 386--393.) as the Artificial Intelligence Design Challenge for the 1987 American Institute of...
Persistent link: https://www.econbiz.de/10009218412
Cover Image
A framework for analyzing sub-optimal performance of local search algorithms
Nikolaev, Alexander; Jacobson, Sheldon; Hall, Shane; … - In: Computational Optimization and Applications 49 (2011) 3, pp. 407-433
Persistent link: https://www.econbiz.de/10009149874
Cover Image
MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems
Juan, Angel; Faulin, Javier; Ferrer, Albert; Lourenço, … - In: TOP: An Official Journal of the Spanish Society of … 21 (2013) 1, pp. 109-132
classical heuristics is a powerful one that can be successfully applied in a variety of cases. Copyright Sociedad de Estadística …
Persistent link: https://www.econbiz.de/10010995375
Cover Image
Routing relatively few customers per route
Dullaert, Wout; Bräysy, Olli - In: TOP: An Official Journal of the Spanish Society of … 11 (2003) 2, pp. 325-336
Persistent link: https://www.econbiz.de/10005598393
Cover Image
A school bus scheduling problem
Kim, Byung-In; Kim, Seongbae; Park, Junhyuk - In: European Journal of Operational Research 218 (2012) 2, pp. 577-585
proposed for special cases and a heuristic algorithm is proposed for more general cases. Benchmark problems and computational …
Persistent link: https://www.econbiz.de/10010574128
Cover Image
EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem
Perboli, Guido; Pezzella, Ferdinando; Tadei, Roberto - In: Computational Statistics 68 (2008) 2, pp. 361-382
algorithm described here hybridizes two very simple heuristics and introduces a new genetic operator, the Chain Mutation, as …This paper presents EVE-OPT, a Hybrid Algorithm based on Genetic Algorithms and Taboo Search for solving the …
Persistent link: https://www.econbiz.de/10010847784
Cover Image
Integrating nonlinear branch-and-bound and outer approximation for convex Mixed Integer Nonlinear Programming
Melo, Wendel; Fampa, Marcia; Raupp, Fernanda - In: Journal of Global Optimization 60 (2014) 2, pp. 373-389
In this paper, we present a new hybrid algorithm for convex Mixed Integer Nonlinear Programming (MINLP). The proposed … hybrid algorithm is an improved version of the classical nonlinear branch-and-bound (BB) procedure, where the enhancements … are obtained with the application of the outer approximation algorithm on some nodes of the enumeration tree. The two …
Persistent link: https://www.econbiz.de/10010937785
Cover Image
EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem
Perboli, Guido; Pezzella, Ferdinando; Tadei, Roberto - In: Mathematical Methods of Operations Research 68 (2008) 2, pp. 361-382
algorithm described here hybridizes two very simple heuristics and introduces a new genetic operator, the Chain Mutation, as …This paper presents EVE-OPT, a Hybrid Algorithm based on Genetic Algorithms and Taboo Search for solving the …
Persistent link: https://www.econbiz.de/10010950190
Cover Image
AN EFFICIENT AND PRACTICALLY ROBUST HYBRID METAHEURISTIC ALGORITHM FOR SOLVING FUZZY BUS TERMINAL LOCATION PROBLEMS
BABAIE-KAFAKI, SAMAN; GHANBARI, REZA; MAHDAVI-AMIRI, NEZAM - In: Asia-Pacific Journal of Operational Research (APJOR) 29 (2012) 02, pp. 1250009-1
fuzzy neighborhood is considered. These problems being NP-hard, we use a genetic algorithm (GA) and a simulated annealing … (SA) algorithm for solving them. We also propose an idea to hybridize these algorithms. In our hybrid algorithm, SA is … iterations in GA. We then implement GA, SA, our hybrid algorithm, and a recently proposed hybrid algorithm making use of a …
Persistent link: https://www.econbiz.de/10010540982