MICAI 2005: MICAI 2005: Advances in Artificial Intelligence pp 185-194 | Cite as
Scheduling Transportation Events with Grouping Genetic Algorithms and the Heuristic DJD
Abstract
Grouping problems arise in many applications, and the aim is to partition a set U of items, into a collection of mutually disjoint subsets or groups. The objective of grouping is to optimize a cost function such as to minimize the number of groups. Problems in this category may come from many different domains such as graph coloring, bin packing, cutting stock, and scheduling. This investigation is related in particular to scheduling transportation events, modeled as a grouping problem, and with the objective to minimize the number of vehicles used and satisfying the customer demand. There is a set of events to be scheduled (items) into a set of vehicles (groups). Of course, there are constraints that forbid assigning all events to a single vehicle. Two different techniques are used in this work to tackle the problem: Grouping Genetic Algorithms and an algorithm based on the heuristic DJD widely used for solving bin packing problems. Both methods were adapted to the problem and compared to each other using a set of randomly generated problem instances designed to comply with real situations.
Keywords
Packing Problem Graph Coloring Soft Constraint Hard Constraint Grouping ProblemPreview
Unable to display preview. Download preview PDF.
References
- 1.Falkenauer, E.: Genetic Algorithms and Grouping Problems. Wiley, Chichester (1998)Google Scholar
- 2.Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman and Company, New York (1979)MATHGoogle Scholar
- 3.Hang, X., Zhi-Long, C., Srinivas, R., Sundar, A.: Solving a practical pickup and delivery problem. Transportation Science 37(3) (2003)Google Scholar
- 4.Savelsbergh, M.W.P., Sol, M.: The general pickup and delivery problem. Transportation Science 29(1) (1995)Google Scholar
- 5.Sakawa, M., Nishizaki, I., Uemura, Y.: Interactive fuzzy programming for a decentralized two-level transportation planning and work force assignment problem. IEEE, Los Alamitos (2001)Google Scholar
- 6.Rich, J.L.: A Computational Study of Vehicle Routing Applications. PhD thesis, Rice University (1999)Google Scholar
- 7.Ross, P., Schulenberg, S., Marín-Blázquez, J.G., Hart, E.: Hyper-heuristics: learning to combine simple heuristics in bin-packing problem. In: Genetic and Evolutionary Computation Conference (2002)Google Scholar
- 8.Goldberg, D.: Genetic Algorithms in Search, Optimization and Machine Learning. Adison Wesley (1989)Google Scholar
- 9.Djang, P.A., Finch, P.R.: Solving one dimension bin-packing problems. Journal of Heuristics (1998)Google Scholar
- 10.Beasley, J.E.: Beasley operations research library. Collection of problems for packing and cutting (2003)Google Scholar
- 11.Scholl, A., Klein, R.: Bin packing library. Collection of bin packing problems (2003)Google Scholar