108 Hits in 5.1 sec

A composite-neighborhood tabu search approach to the traveling tournament problem

Luca Di Gaspero, Andrea Schaerf
2007 Journal of Heuristics  
The Traveling Tournament Problem (TTP) is a combinatorial problem that combines features from the traveling salesman problem and the tournament scheduling problem.  ...  We propose a family of tabu search solvers for the solution of TTP that make use of complex combination of many neighborhood structures.  ...  We are also grateful to Michael Trick for maintaining the TTP web page. Finally, we thank an anonymous referee for helpful comments that allowed us to improve the paper.  ... 
doi:10.1007/s10732-006-9007-x fatcat:exnf656mzfe7pkvp5wgqfhuj7u

Traveling Tournament Scheduling: A Systematic Evaluation of Simulated Annealling [chapter]

Pascal Van Hentenryck, Yannis Vergados
2006 Lecture Notes in Computer Science  
This paper considers all the variants of the traveling tournament problem (TTP) proposed in [17, 7] to abstract the salient features of major league baseball (MLB) in the United States.  ...  The main technical contribution underlying these results is a number of compositive neighborhood moves that aggregate sequences of existing moves; these novel moves preserve the mirroring or distance structure  ...  Our neighborhood, or a subset of it, was reused in subsequent work (e.g., [8, 12, 16] ) within tabu-search and GRASP approaches or, even, simulated annealing.  ... 
doi:10.1007/11757375_19 fatcat:cbl6pitxevce3f64ecurcxmrny

Scheduling in sports: An annotated bibliography

Graham Kendall, Sigrid Knust, Celso C. Ribeiro, Sebastián Urrutia
2010 Computers & Operations Research  
A composite-neighborhood tabu search approach to the traveling tournament problem. Journal of Heuristics 2007;13:189-207.  ...  The balanced tournament problem (prob026 of CSPLib) is solved with a tabu search algorithm based on a swap neighborhood.  ...  However, in spite of its hardness, it is noticeable that the decision version of the traveling tournament problem is not proved to be NP-complete at the time of writing.  ... 
doi:10.1016/j.cor.2009.05.013 fatcat:dznvxw2ulvhk3gdvpybw324spa

A Comparative Study of Proposed Genetic Algorithm-Based Solution with Other Algorithms for Time-Dependent Vehicle Routing Problem with Time Windows for E-Commerce Supply Chain

Suresh Nanda Kumar, Ramasamy Panneerselvam
2015 Journal of Service Science and Management  
In this paper, an attempt has been made to develop a GA based meta-heuristic to solve the time dependent vehicle route problem with time windows (TDVRPTW).  ...  Hence exact optimization methods may be difficult to solve these problems in acceptable CPU times, when the problem involves real-world data sets that are very large.  ...  Acknowledgements The authors wish to express their deepest gratitude to the researchers Mr. Andreas Scheibenpflug and Mr. Philipp Fleck of FH Hagenberg, Austria, for their help.  ... 
doi:10.4236/jssm.2015.86085 fatcat:v5zcc2mdpncixaqxnmj5mzgkz4

Allocation search methods for a generalized class of location–allocation problems

Martin Bischoff, Kerstin Dächert
2009 European Journal of Operational Research  
We consider a generalized class of location-allocation problems, in which N new facilities are to be located in the plane with respect to M objects.  ...  We intend to impart a generalized view on these randomized search methods and also examine the efficiency of the different search strategies in solving the multi-connection location-allocation problem,  ...  This tabu search strategy can be regarded as an adaption of the variable neighborhood search within the tabu search framework.  ... 
doi:10.1016/j.ejor.2007.10.022 fatcat:vqssr5cnmzai7h7ffmnew4copi

An annotated bibliography of GRASP-Part II: Applications

Paola Festa, Mauricio G. C. Resende
2009 International Transactions in Operational Research  
GRASP has been applied to a wide range of combinatorial optimization problems, ranging from scheduling and routing to drawing and turbine balancing.  ...  optimum in the neighborhood of the constructed solution is sought.  ...  Heuristics for the mirrored traveling tournament problem. European J. of Operational Research, 179:775-787, 2007. The authors study the mirrored version of the traveling tournament problem.  ... 
doi:10.1111/j.1475-3995.2009.00664.x fatcat:wdqwc6xvcnfq3fi5ujy6jy5wtm

Parallel Meta-heuristics [chapter]

Teodor Gabriel Crainic, Michel Toulouse
2010 International Series in Operations Research and Management Science  
vehicles, followed by a tabu search to minimize the total distance traveled.  ...  The decomposition of the search space of the problem at hand is a “natural” approach to attacking such problems.  ... 
doi:10.1007/978-1-4419-1665-5_17 fatcat:5hhwwngx6jb6pnaugdgvenjraq

SVND Enhanced Metaheuristic for Plug-In Hybrid Electric Vehicle Routing Problem

Xiaohui Li, Xuemin Shi, Yi Zhao, Huagang Liang, Yuan Dong
2020 Applied Sciences  
Compared with the traditional Traveling Salesman Problem (TSP) and Vehicle Routing Problem (VRP), the PHEV routing problem should consider more constraints, such as time limits, capacity constraints (including  ...  The path-planning optimization for PHEV has become a major challenge. In fact, PHEV-based routing optimization is a type of hybrid vehicle routing problem (HVRP).  ...  Abbreviations The notations is introduced as follows:  ... 
doi:10.3390/app10020441 fatcat:vy3rxjudyvgjzhgp4nvclbi4ei

Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care

Ran Liu, Xiaolan Xie, Vincent Augusto, Carlos Rodriguez
2013 European Journal of Operational Research  
We then propose a Genetic Algorithm (GA) and a Tabu Search (TS) method. The GA is based on a permutation chromosome, a split procedure and local search.  ...  The problem can be considered as a special vehicle routing problem with simultaneous delivery and pickup and time windows, with four types of demands: delivery from depot to patient, delivery from a hospital  ...  The authors are also grateful to OIKIA home health care company for sharing information for home health care logistics.  ... 
doi:10.1016/j.ejor.2013.04.044 fatcat:2wuzabv7efhx3l3e4kl5h2x6i4

A Physics Based Novel Approach for Travelling Tournament Problem: Optics Inspired Optimization

Bilal Alatas, Harun Bingol
2019 Information Technology and Control  
In this study, OIO for the first time has been designed as solution search strategy for travelling tournament problem which is one of the current sports problems and aids to minimize transportation and  ...  Optics Inspired Optimization (OIO) is one of the most recent physics inspired computational intelligence methods which treats the search space of the problem to be optimized as a wavy mirror in which each  ...  Acknowledgments We would like to present our thanks to anonymous reviewers and the esteemed editors for their helpful suggestions.  ... 
doi:10.5755/j01.itc.48.3.20627 fatcat:yl2mmtdxanfp5a4njddcmxlzzq

Revised GRASP with path-relinking for the linear ordering problem

W. Art Chaovalitwongse, Carlos A. S. Oliveira, Bruno Chiarini, Panos M. Pardalos, Mauricio G. C. Resende
2010 Journal of combinatorial optimization  
It has, however, drawn little attention compared to other closely related problems such as the quadratic assignment problem and the traveling salesman problem.  ...  Due to its computational complexity, it is essential in practice to develop solution approaches to rapidly search for solution of high-quality.  ...  Acknowledgments This work was partially supported by the the NSF CAREER grant CCF-0546574 and Rutgers Research Council grant 202018.  ... 
doi:10.1007/s10878-010-9306-x fatcat:q3iegwgsaffidkws7jxs45shja

Comet in context

Laurent Michel, Pascal Van Hentenryck
2003 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday - PCK50  
This paper contains a brief description of Comet, an object-oriented language supporting a constraint-based architecture for neighborhood search.  ...  It contrasts Comet to constraint programming languages and shows how constraint programming and Comet provides many of the same benefits for constraint satisfaction and neighborhood search respectively  ...  For instance, at the time of writing, the best approach to the travelling tournament problem, an abstraction of Major League Baseball scheduling, is a neighborhood search method which significantly outperforms  ... 
doi:10.1145/778348.778361 fatcat:t7kzt3awtnc2bb5qh7gnzow2r4

Assigning judges to competitions of several rounds using Tabu search

Amina Lamghari, Jacques A. Ferland
2011 European Journal of Operational Research  
We tackle the corresponding problem with a metaheuristic approach based on Tabu search. The numerical results indicate that very good solutions can be generated in reasonable computational times.  ...  The judge assignment problem consists in finding an assignment satisfying the competition rules (hard constraints) and meeting, as much as possible, the competition organizers objectives (soft constraints  ...  Thanks are also due to the referees for their valuable comments.  ... 
doi:10.1016/j.ejor.2010.10.034 fatcat:fpm6bgfdindwdnsnivcla7gvcy

Hybrid GRASP Heuristics [chapter]

Paola Festa, Mauricio G. C. Resende
2009 Studies in Computational Intelligence  
This chapter gives an overview of different ways to hybridize GRASP (Greedy Randomized Adaptive Search Procedures) to create new and more effective metaheuristics.  ...  Experience has shown that a crafted combination of concepts of different metaheuristics can result in robust combinatorial optimization schemes and produce higher solution quality than the individual metaheuristics  ...  Ribeiro and Urrutia [63] designed a hybrid GRASP with ILS for the mirrored traveling tournament problem, where the acceptance rule makes use of a threshold parameter β, initialized to 0.001.  ... 
doi:10.1007/978-3-642-01085-9_4 fatcat:xmrpoff3hbhrvnhzgjvth46ioa

Generation of operating procedures for a mixing tank with a micro genetic algorithm

Rafael Batres
2013 Computers and Chemical Engineering  
This paper explores the use of a micro genetic algorithm coupled with variable-length chromosomes and a seeding scheme based on tabu search.  ...  The problem is to find the sequence of actions that have to be executed in the shortest time possible, but also in a way that minimizes the possibility of situations that may endanger the plant personnel  ...  Acknowledgements This paper is a revised and extended version of a paper that was presented at the PSE 2012 Computers and Chemical Engineering 57 (2013) 112-121 doi:10.1016/j.compchemeng.2013  ... 
doi:10.1016/j.compchemeng.2013.04.016 fatcat:xusugcb7zzbddaqbigdzoptcsm
« Previous Showing results 1 — 15 out of 108 results