Column generation based heuristics for a generalized location routing problem with profits arising in space exploration

Cited 20 time in webofscience Cited 0 time in scopus
  • Hit : 405
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorAhn, Jaemyungko
dc.contributor.authorde Weck, Olivierko
dc.contributor.authorGeng, Yueko
dc.contributor.authorKlabjan, Diegoko
dc.date.accessioned2013-03-12T14:26:45Z-
dc.date.available2013-03-12T14:26:45Z-
dc.date.created2012-10-30-
dc.date.created2012-10-30-
dc.date.issued2012-11-
dc.identifier.citationEUROPEAN JOURNAL OF OPERATIONAL RESEARCH, v.223, no.1, pp.47 - 59-
dc.identifier.issn0377-2217-
dc.identifier.urihttp://hdl.handle.net/10203/102584-
dc.description.abstractThe generalized location routing problem with profits is a new routing problem class that combines the vehicle routing problem with profits, depot or base selection, and the notion of strategies and route tactics to be employed at selected bases. The problem simultaneously determines base locations, strategies to use at the bases, sites to visit, and routes to carry out the visits, to maximize the sum of profits that can be obtained by visiting sites, under resource consumption constraints. The problem arises in exploration of planetary bodies where strategies correspond to different technologies. A description of the generalized location routing problem with profits and its mathematical formulation as an integer program are provided. Two solution methodologies to solve the problem - branch-and-price and a three-phase heuristic method combined with a generalized randomized adaptive search procedure - are proposed. Numerical experiments for the two solution methodologies are carried out. Their performance in terms of computation time and optimality gap are analyzed and compared to establish the problem characteristics, indicating which method is more advantageous. (C) 2012 Elsevier B.V. All rights reserved.-
dc.languageEnglish-
dc.publisherELSEVIER SCIENCE BV-
dc.subjectMAXIMUM COLLECTION PROBLEM-
dc.subjectTRAVELING SALESMAN PROBLEM-
dc.subjectTEAM ORIENTEERING PROBLEM-
dc.subjectMODELS-
dc.titleColumn generation based heuristics for a generalized location routing problem with profits arising in space exploration-
dc.typeArticle-
dc.identifier.wosid000307796100005-
dc.identifier.scopusid2-s2.0-84864475302-
dc.type.rimsART-
dc.citation.volume223-
dc.citation.issue1-
dc.citation.beginningpage47-
dc.citation.endingpage59-
dc.citation.publicationnameEUROPEAN JOURNAL OF OPERATIONAL RESEARCH-
dc.identifier.doi10.1016/j.ejor.2012.06.018-
dc.contributor.localauthorAhn, Jaemyung-
dc.contributor.nonIdAuthorde Weck, Olivier-
dc.contributor.nonIdAuthorGeng, Yue-
dc.contributor.nonIdAuthorKlabjan, Diego-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorHeuristics-
dc.subject.keywordAuthorBranch and bound-
dc.subject.keywordAuthorRouting-
dc.subject.keywordAuthorLocation-
dc.subject.keywordAuthorTransportation-
dc.subject.keywordAuthorLogistics-
dc.subject.keywordPlusMAXIMUM COLLECTION PROBLEM-
dc.subject.keywordPlusTRAVELING SALESMAN PROBLEM-
dc.subject.keywordPlusTEAM ORIENTEERING PROBLEM-
dc.subject.keywordPlusMODELS-
Appears in Collection
AE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 20 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0