AttributesValues
type
value
  • In their operations private chauffeur companies have to solve variations of the multiple objective dial a ride problem. The number and type of restrictions make the problem extremely intricate and, when manually done, requires specialized people with a deep knowledge of the modus operandi of the company and of the environment in which the procedure takes place. Nevertheless, the scheduling can be automated through mean of computational methods, allowing to deliver solutions faster and, possible, optimized. In this context, this paper compares six algorithms applied to solving a multiple objective dial a ride problem, using data from a company mainly working in the Algarve, Portugal. The achieved results show that [Formula: see text]-MOEA overcomes the other algorithms tested, namely the NSGA-II, NSGA-III, [Formula: see text]-NSGA-II, SPEA2, and PESA2.
subject
  • Portugal
  • Southern European countries
  • Criminology
  • Mathematical optimization
  • Decision analysis
  • Multiple-criteria decision analysis
part of
is abstract of
is hasSource of
Faceted Search & Find service v1.13.91 as of Mar 24 2020


Alternative Linked Data Documents: Sponger | ODE     Content Formats:       RDF       ODATA       Microdata      About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data]
OpenLink Virtuoso version 07.20.3229 as of Jul 10 2020, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (94 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software