@InProceedings{MauriLore:2006:GeMuMo,
               author = "Mauri, Geraldo Regis and Lorena, Luiz Antonio Nogueira",
          affiliation = "Instituto Nacional de Pesquisas Espaciais, Laborat{\'o}rio 
                         Associado de Computa{\c{c}}{\~a}o e Matem{\'a}tica Aplicada 
                         (INPE.LAC) and Instituto Nacional de Pesquisas Espaciais, 
                         Laborat{\'o}rio Associado de Computa{\c{c}}{\~a}o e 
                         Matem{\'a}tica Aplicada (INPE.LAC)",
                title = "A general multi-objective model for dial-a-ride problem solved by 
                         simulated annealing",
            booktitle = "Proceedings...",
                 year = "2006",
         organization = "International Symposium on Mathematical Programming, 19.",
             keywords = "dial-a-ride problem, multi-objective models, simulated annealing, 
                         vehicle routing problem.",
             abstract = "This paper describes a general multiobjective mathematical model 
                         for dial-aride problem and an application of Simulated Annealing 
                         to solve it. The dial-aride problem consists of designing 
                         economical routes that assist customers requests without violating 
                         operational and qualitative restrictions. A request consists of 
                         specific origin-destination transportation with demand. The model 
                         deals with a static mode of problem and comprehend several 
                         distinct cases of the regular problem such as heterogeneous or 
                         homogeneous fleet of vehicles, multi or single depot and a 
                         multi-objective minimizing function that treats transportation 
                         costs and customer inconveniences over weighting against each 
                         other. The Simulated Annealing application is simple, but for the 
                         new neighbors generation, three types of moves are randomly used 
                         through a uniform distribution, and the routes are clustered and 
                         scheduled in a separate way for other heuristic methods. 
                         Computational results are performed over publicly available data 
                         sets and the results are compared against current state-of-the-art 
                         methods.",
  conference-location = "Rio de Janeiro, RJ",
      conference-year = "2006-07-30",
             language = "en",
        urlaccessdate = "17 jan. 2021"
}