About: A Comparison of Multiple Objective Algorithms in the Context of a Dial a Ride Problem

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: A Comparison of Multiple Objective Algorithms in the Context of a Dial a Ride Problem Goto Sponge NotDistinct Permalink

An Entity of Type : schema:ScholarlyArticle, within Data Space : wasabi.inria.fr associated with source document(s)

Attributes	Values
type	Academic Article research paper schema:ScholarlyArticle
isDefinedBy	Covid-on-the-Web dataset
has title	A Comparison of Multiple Objective Algorithms in the Context of a Dial a Ride Problem
Creator	Cardoso, Pedro Fernandes, Hortênsio Guerreiro, Pedro
Source	PMC
abstract	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.
has issue date	2020-05-25(xsd:dateTime)
bibo:doi	10.1007/978-3-030-50436-6_28
has license	no-cc
sha1sum (hex)	df332afb2eb527f9ee55ba7bfa51b29f7272445e
schema:url	https://doi.org/10.1007/978-3-030-50436-6_28
resource representing a document's title	A Comparison of Multiple Objective Algorithms in the Context of a Dial a Ride Problem
has PubMed Central identifier	PMC7304764
schema:publication	Computational Science - ICCS 2020
resource representing a document's body	covid:df332afb2eb527f9ee55ba7bfa51b29f7272445e#body_text
is schema:about of	named entity 'procedure' named entity 'DIAL' named entity 'PRIVATE' named entity 'MEAN' named entity 'MANUALLY' named entity 'NUMBER' named entity 'COMPANIES' named entity 'EXTREMELY' named entity 'METHODS' named entity 'POSSIBLE' named entity 'OPERATIONS' covid:arg/df332afb2eb527f9ee55ba7bfa51b29f7272445e named entity 'automated' named entity 'algorithms' named entity 'context' named entity 'candidate solutions' named entity 'Python' named entity 'NSGA-II' named entity 'objective function' named entity 'DARP' named entity 'Pareto' named entity 'Pareto' named entity 'Microsoft Windows 10' named entity 'DARP' named entity 'Non-dominated Sorting Genetic Algorithm II' named entity 'heuristic' named entity 'vehicle routing problem' named entity 'computational time' named entity 'OSRM' named entity 'probability' named entity 'Open Street Maps' named entity 'directed network' named entity 'evolutionary algorithm' named entity 'drivers working hours' named entity 'NSGA-II' named entity 'selective fitness' named entity 'mating pool' named entity 'objective' named entity 'Ride' named entity 'Objective' named entity 'modus operandi' named entity 'Algarve' named entity 'Dial a Ride' named entity 'DARP' named entity 'IBEA' named entity 'evolutionary algorithm' named entity 'evolutionary computing' named entity 'C++' named entity 'Multi-Objective' named entity 'crossover operator' named entity 'genetic algorithms' named entity 'cartography' named entity 'objective function' named entity 'Non-dominated Sorting Genetic Algorithm II' named entity 'decision maker' named entity 'pareto' named entity 'unit of selection' named entity 'NSGA-II' named entity 'NSGA-II' named entity 'NSGA-II' named entity 'ant colony optimization' named entity 'decision makers' named entity 'Selection Algorithm' named entity 'decision maker' named entity 'Intel i7' named entity 'constraint programming' named entity 'genetic algorithm' named entity 'algorithm' named entity 'mixed-integer programming' named entity 'randomly chosen' named entity 'NSGA-II' named entity 'NP-hard' named entity 'Pareto' named entity 'Evolutionary Algorithm' named entity 'start point' named entity 'standard deviation' named entity 'lineament' named entity 'Open Source Routing Machine' named entity 'local search' named entity 'heuristic' named entity 'algorithm'

Faceted Search & Find service v1.13.91 as of Mar 24 2020

Alternative Linked Data Documents: Sponger | ODE Content Formats:

RDF

ODATA

Microdata

About

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-2024 OpenLink Software