NGAP: a novel hybrid metaheuristic algorithm for round-trip carsharing fleet planning

Reference : NGAP: a novel hybrid metaheuristic algorithm for round-trip carsharing fleet planning


	Document type :	Scientific congresses, symposiums and conference proceedings : Paper published in a book
	Discipline(s) :	Engineering, computing & technology : Computer science
	To cite this reference:	http://hdl.handle.net/10993/43998

Title :	NGAP: a novel hybrid metaheuristic algorithm for round-trip carsharing fleet planning
Language :	English
Author, co-author :	Changaival, Boonyarit [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > Computer Science and Communications Research Unit (CSC) >]
	Danoy, Grégoire [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > Computer Science and Communications Research Unit (CSC)]
	Kliazovich [Examotive S.A.]
	Guinand, Frédéric [University of Normandy, France]
	Brust, Matthias R. [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) >]
	Musial, Jedrzej [Poznan University of Technology, Poland]
	Lavangnananda, Kittichai [KMUTT, Thailand]
	Bouvry, Pascal [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)]
Publication date :	2020
Main document title :	GECCO '20: Genetic and Evolutionary Computation Conference, Companion Volume, Cancún, Mexico, July 8-12, 2020
Publisher :	ACM
Pages :	259--260
Peer reviewed :	Yes
On invitation :	No
Audience :	International
Event name :	Genetic and Evolutionary Computation Conference (GECCO 2020)
Event date :	from 08-07-2020 to 12-07-2020
Permalink :	http://hdl.handle.net/10993/43998
DOI :	10.1145/3377929.3389941
Other URL :	https://doi.org/10.1145/3377929.3389941

File(s) associated to this reference

Fulltext file(s):

	File	Commentary	Version	Size	Access
Limited access	3377929.3389941.pdf		Publisher postprint	501.75 kB	Request a copy

All documents in ORBi^lu are protected by a user license.