A branch-and-cut algorithm for the target visitation problem
In this paper, we consider the target visitation problem (TVP) which arises in the context of disaster treatment. Mathematically speaking, the problem is concerned with finding a route to visit a set of targets starting from and returning to some base. In addition to the distance travelled, a tour i...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Dokumenttyp: | Article (Journal) |
| Sprache: | Englisch |
| Veröffentlicht: |
27 April 2019
|
| In: |
EURO journal on computational optimization
Year: 2019, Jahrgang: 7, Heft: 3, Pages: 209-242 |
| ISSN: | 2192-4414 |
| DOI: | 10.1007/s13675-019-00111-x |
| Online-Zugang: | Resolving-System, Volltext: https://doi.org/10.1007/s13675-019-00111-x Verlag: https://link.springer.com/article/10.1007%2Fs13675-019-00111-x 
|
| Verfasserangaben: | Achim Hildenbrandt |
MARC
| LEADER | 00000caa a2200000 c 4500 | ||
|---|---|---|---|
| 001 | 1683712056 | ||
| 003 | DE-627 | ||
| 005 | 20220817170143.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 191128s2019 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s13675-019-00111-x |2 doi | |
| 035 | |a (DE-627)1683712056 | ||
| 035 | |a (DE-599)KXP1683712056 | ||
| 035 | |a (OCoLC)1341279061 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rda | ||
| 041 | |a eng | ||
| 084 | |a 28 |2 sdnb | ||
| 100 | 1 | |a Hildenbrandt, Achim |e VerfasserIn |0 (DE-588)1044411015 |0 (DE-627)772025789 |0 (DE-576)397198337 |4 aut | |
| 245 | 1 | 2 | |a A branch-and-cut algorithm for the target visitation problem |c Achim Hildenbrandt |
| 264 | 1 | |c 27 April 2019 | |
| 300 | |a 34 | ||
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 500 | |a Gesehen am 28.11.2019 | ||
| 520 | |a In this paper, we consider the target visitation problem (TVP) which arises in the context of disaster treatment. Mathematically speaking, the problem is concerned with finding a route to visit a set of targets starting from and returning to some base. In addition to the distance travelled, a tour is evaluated by taking also preferences into account which address the sequence in which the targets are visited. The problem thus is a combination of two well-known combinatorial optimization problems: the traveling salesman and the linear ordering problem. In this paper, we point out some polyhedral properties, develop a branch-and-cut algorithm for solving the TVP to optimality and present some computational results. | ||
| 650 | 4 | |a 05C20 | |
| 650 | 4 | |a 05C38 | |
| 650 | 4 | |a 90C10 | |
| 650 | 4 | |a 90C35 | |
| 650 | 4 | |a 90C57 | |
| 650 | 4 | |a Branch-and-cut | |
| 650 | 4 | |a Linear ordering problem | |
| 650 | 4 | |a Polyhedra theory | |
| 650 | 4 | |a Traveling salesman problem | |
| 773 | 0 | 8 | |i Enthalten in |t EURO journal on computational optimization |d Amsterdam : Elsevier, 2013 |g 7(2019), 3, Seite 209-242 |h Online-Ressource |w (DE-627)736559140 |w (DE-600)2703307-7 |w (DE-576)378985736 |x 2192-4414 |7 nnas |a A branch-and-cut algorithm for the target visitation problem |
| 773 | 1 | 8 | |g volume:7 |g year:2019 |g number:3 |g pages:209-242 |g extent:34 |a A branch-and-cut algorithm for the target visitation problem |
| 856 | 4 | 0 | |u https://doi.org/10.1007/s13675-019-00111-x |x Resolving-System |x Verlag |3 Volltext |
| 856 | 4 | 0 | |u https://link.springer.com/article/10.1007%2Fs13675-019-00111-x |x Verlag |
| 951 | |a AR | ||
| 992 | |a 20191128 | ||
| 993 | |a Article | ||
| 994 | |a 2019 | ||
| 998 | |g 1044411015 |a Hildenbrandt, Achim |m 1044411015:Hildenbrandt, Achim |d 110000 |d 110300 |e 110000PH1044411015 |e 110300PH1044411015 |k 0/110000/ |k 1/110000/110300/ |p 1 |x j |y j | ||
| 999 | |a KXP-PPN1683712056 |e 3550920768 | ||
| BIB | |a Y | ||
| SER | |a journal | ||
| JSO | |a {"title":[{"title_sort":"branch-and-cut algorithm for the target visitation problem","title":"A branch-and-cut algorithm for the target visitation problem"}],"person":[{"family":"Hildenbrandt","given":"Achim","roleDisplay":"VerfasserIn","display":"Hildenbrandt, Achim","role":"aut"}],"language":["eng"],"recId":"1683712056","note":["Gesehen am 28.11.2019"],"type":{"bibl":"article-journal","media":"Online-Ressource"},"id":{"doi":["10.1007/s13675-019-00111-x"],"eki":["1683712056"]},"origin":[{"dateIssuedDisp":"27 April 2019","dateIssuedKey":"2019"}],"name":{"displayForm":["Achim Hildenbrandt"]},"relHost":[{"id":{"eki":["736559140"],"zdb":["2703307-7"],"issn":["2192-4414"]},"origin":[{"dateIssuedKey":"2013","publisher":"Elsevier ; Springer","dateIssuedDisp":"2013-","publisherPlace":"Amsterdam ; Berlin ; Heidelberg ; New York"}],"physDesc":[{"extent":"Online-Ressource"}],"title":[{"title":"EURO journal on computational optimization","title_sort":"EURO journal on computational optimization"}],"part":{"pages":"209-242","issue":"3","year":"2019","extent":"34","volume":"7","text":"7(2019), 3, Seite 209-242"},"pubHistory":["2013 -"],"language":["eng"],"recId":"736559140","note":["Gesehen am 09.08.24","Fortsetzung der Druck-Ausgabe"],"disp":"A branch-and-cut algorithm for the target visitation problemEURO journal on computational optimization","type":{"bibl":"periodical","media":"Online-Ressource"}}],"physDesc":[{"extent":"34 S."}]} | ||
| SRT | |a HILDENBRANBRANCHANDC2720 | ||