A New Mathematical Model for the Traveling Repairman Problem

Naeni, LM; Salehipour, A

A New Mathematical Model for the Traveling Repairman Problem

Naeni, LM Salehipour, A

Permalink

Publisher:: IEEE
Publication Type:: Conference Proceeding
Citation:: IEEE International Conference on Industrial Engineering and Engineering Management, 2020, pp. 1384-1387
Issue Date:: 2020

Closed Access

	Filename	Description	Size
	08978898.pdf	Published version	197.19 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Naeni, LM
dc.contributor.author	Salehipour, A
dc.date	2019-12-15
dc.date.accessioned	2020-05-01T21:44:04Z
dc.date.available	2020-05-01T21:44:04Z
dc.date.issued	2020
dc.identifier.citation	IEEE International Conference on Industrial Engineering and Engineering Management, 2020, pp. 1384-1387
dc.identifier.isbn	9781728138046
dc.identifier.issn	2157-3611
dc.identifier.issn	2157-362X
dc.identifier.uri	http://hdl.handle.net/10453/140391
dc.description.abstract	© 2019 IEEE. We propose a new mixed-integer program for the traveling repairman problem (TRP). The model benefits from the position-based variables. We aim to utilize only available solvers for optimizing the model. We test the proposed model by solving 70 randomly generated instances, ranging from 10 to 50 vertices, from the literature by CPLEX, and comparing its solutions with those of available models from the literature. We show that our model delivers the largest number of best solutions and that in a shorter time.
dc.language	en
dc.publisher	IEEE
dc.relation	http://purl.org/au-research/grants/arc/DE170100234
dc.relation.ispartof	IEEE International Conference on Industrial Engineering and Engineering Management
dc.relation.ispartof	IEEE International Conference on Industrial Engineering and Engineering Management
dc.relation.isbasedon	10.1109/IEEM44572.2019.8978898
dc.rights	© 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.	en_US
dc.rights	info:eu-repo/semantics/restrictedAccess
dc.title	A New Mathematical Model for the Traveling Repairman Problem
dc.type	Conference Proceeding
utslib.location.activity	Macao, Macao
pubs.organisational-group	/University of Technology Sydney/Faculty of Science
pubs.organisational-group	/University of Technology Sydney/Faculty of Science/School of Mathematical and Physical Sciences
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Design, Architecture and Building
pubs.organisational-group	/University of Technology Sydney/Faculty of Design, Architecture and Building/School of Built Environment
utslib.copyright.status	closed_access	*
pubs.consider-herdc	false
dc.date.updated	2020-05-01T21:44:00Z
pubs.finish-date	2019-12-17
pubs.place-of-publication	Piscataway, USA
pubs.publication-status	Published
pubs.start-date	2019-12-15
utslib.start-page	1384
dc.location	Piscataway, USA

Abstract:

© 2019 IEEE. We propose a new mixed-integer program for the traveling repairman problem (TRP). The model benefits from the position-based variables. We aim to utilize only available solvers for optimizing the model. We test the proposed model by solving 70 randomly generated instances, ranging from 10 to 50 vertices, from the literature by CPLEX, and comparing its solutions with those of available models from the literature. We show that our model delivers the largest number of best solutions and that in a shorter time.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/140391