A Global Repair Operator for Capacitated Arc Routing Problem
暂无分享,去创建一个
[1] Gilbert Laporte,et al. A Tabu Search Heuristic for the Capacitated Arc Routing Problem , 2000, Oper. Res..
[2] M. Dror. Arc Routing : Theory, Solutions and Applications , 2000 .
[3] Philippe Lacomme,et al. Competitive Memetic Algorithms for Arc Routing Problems , 2004, Ann. Oper. Res..
[4] Xin Yao,et al. Robust Solution of Salting Route Optimisation Using Evolutionary Algorithms , 2006, 2006 IEEE International Conference on Evolutionary Computation.
[5] Dino Ahr,et al. Contributions to Multiple Postmen Problems , 2004 .
[6] Peter Greistorfer,et al. A Tabu Scatter Search Metaheuristic for the Arc Routing Problem , 2002 .
[7] Greg N. Frederickson,et al. Approximation Algorithms for Some Postman Problems , 1979, JACM.
[8] Matthias Gröbner,et al. Optimizing Employee Schedules by a Hybrid Genetic Algorithm , 2001, EvoWorkshops.
[9] David S. Johnson,et al. Approximation Algorithms for Bin-Packing — An Updated Survey , 1984 .
[10] Ángel Corberán,et al. The Capacitated Arc Routing Problem: Lower bounds , 1992, Networks.
[11] Luc Muyldermans,et al. A guided local search heuristic for the capacitated arc routing problem , 2003, Eur. J. Oper. Res..
[12] S K Amponsah,et al. The investigation of a class of capacitated arc routing problems: the collection of garbage in developing countries. , 2004, Waste management.
[13] Roberto Baldacci,et al. Exact methods based on node-routing formulations for undirected arc-routing problems , 2006 .
[14] Z. Michalewicz,et al. Genocop III: a co-evolutionary algorithm for numerical optimization problems with nonlinear constraints , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.
[15] H. Handa,et al. Robust route optimization for gritting/salting trucks: a CERCIA experience , 2006, IEEE Computational Intelligence Magazine.
[16] Maria Cândida Mourão,et al. Heuristic method for a mixed capacitated arc routing problem: A refuse collection application , 2005, Eur. J. Oper. Res..
[17] Wen Lea Pearn,et al. Approximate solutions for the capacitated arc routing problem , 1989, Comput. Oper. Res..
[18] M. BelenguerJ.,et al. The Capacitated Arc Routing Problem , 1998 .
[19] G. Ulusoy. The fleet size and mix problem for capacitated arc routing , 1985 .
[20] Bruce L. Golden,et al. Capacitated arc routing problems , 1981, Networks.
[21] Bruce L. Golden,et al. Computational experiments with algorithms for a class of routing problems , 1983, Comput. Oper. Res..
[22] Richard W. Eglese,et al. An Interactive Algorithm for Vehicle Routeing for Winter — Gritting , 1996 .
[23] Samuel Pierre,et al. Assigning cells to switches in cellular mobile networks using taboo search , 2002, IEEE Trans. Syst. Man Cybern. Part B.
[24] Isao Ono,et al. Constraint-Handling Method for Multi-objective Function Optimization: Pareto Descent Repair Operator , 2007, EMO.
[25] Philippe Lacomme,et al. A Genetic Algorithm for the Capacitated Arc Routing Problem and Its Extensions , 2001, EvoWorkshops.
[26] Marcus Poggi de Aragão,et al. Solving capacitated arc routing problems using a transformation to the CVRP , 2006, Comput. Oper. Res..
[27] Richard W. Eglese,et al. Routeing Winter Gritting Vehicles , 1994, Discret. Appl. Math..
[28] Richard W. Eglese,et al. A deterministic tabu search algorithm for the capacitated arc routing problem , 2008, Comput. Oper. Res..
[29] Carlos A. Coello Coello,et al. THEORETICAL AND NUMERICAL CONSTRAINT-HANDLING TECHNIQUES USED WITH EVOLUTIONARY ALGORITHMS: A SURVEY OF THE STATE OF THE ART , 2002 .
[30] Osamu Katai,et al. Coevolutionary genetic algorithm for constraint satisfaction with a genetic repair operator for effective schemata formation , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).
[31] José-Manuel Belenguer,et al. A cutting plane algorithm for the capacitated arc routing problem , 2003, Comput. Oper. Res..
[32] John E. Beasley,et al. A Genetic Algorithm for the Multidimensional Knapsack Problem , 1998, J. Heuristics.
[33] Tetsuhiro Miyahara,et al. A Co-evolving Timeslot/Room Assignment Genetic Algorithm Technique for University Timetabling , 2000, PATAT.
[34] Qingfu Zhang,et al. An evolutionary algorithm with guided mutation for the maximum clique problem , 2005, IEEE Transactions on Evolutionary Computation.
[35] Wen Lea Pearn,et al. Augment-insert algorithms for the capacitated arc routing problem , 1991, Comput. Oper. Res..
[36] Alain Hertz,et al. A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem , 2001, Transp. Sci..
[37] Tianzi Jiang,et al. An evolutionary tabu search for cell image segmentation , 2002, IEEE Trans. Syst. Man Cybern. Part B.
[38] Richard W. Eglese,et al. A tabu search based heuristic for arc routing with a capacity constraint and time deadline , 1996 .