The Capacitated Arc Routing Problem arises in several contexts where streets or roads must be traversed for maintenance purposes or for the delivery of services. A tabu search is proposed for this difficult problem. On benchmark instances, it outperforms all known heuristics and often produces a proven optimum.
The undirected capacitated arc routing problem (CARP) arises naturally in several applications where streets require maintenance, or customers located along road must be serviced. Basic algorithmic procedures have recently been developed for the design of heuristics in an arc routing context. This article reports on the use of these basic tools in a variable neighborhood descent algorithm for the solution of the undirected CARP.
This article considers a tool loading problem whose objective is to minimize the number of tool switches over time in order to process several parts on a¯exible machine. New heuristics are presented and compared. Some of these are shown to be superior to existing methods.
This article considers a tool loading problem whose objective is to minimize the number of tool switches over time in order to process several parts on a¯exible machine. New heuristics are presented and compared. Some of these are shown to be superior to existing methods.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.