The hierarchical traveling salesman problem

Panchamgam, Kiran; Xiong, Yupei; Golden, Bruce L.; Dussault, Benjamin; Wasil, Edward

doi:10.1007/s11590-012-0553-x

Cited by 21 publications

(25 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The approaches that we have just described do not consider different degrees of urgencies at the locations. Panchamgam et al [47] introduce the Hierarchical Traveling Salesman Problem (HTSP), where the sequence in which locations are visited depends on the urgency of their needs. Destinations with similar degrees of urgency are grouped together into priority classes.…”

Section: Response Timementioning

confidence: 99%

“…This can be important when the vehicle's travel time is restricted. A more flexible variant of the described priority rules is the d -relaxed priority rule (Panchamgam [46] and Panchamgam et al [47]). If p is the highest priority class among all unvisited locations, the relaxed rule allows the vehicle to visit locations with priority p, p + 1, .…”

Section: Response Timementioning

confidence: 99%

“…Setting urgency-dependent precedence constraints on the sequence in which locations are visited, as done in the HTSP (Panchamgam et al [47]), favors equitable solutions. In this case, equity is enforced by hard constraints in the model rather than the objective function.…”

Section: Service Equitymentioning

confidence: 99%

“…The respective weights are set to favor the humanitarian metrics. Minimizing the travel distance is the only objective in Panchamgam et al [47]. The urgency of need at locations is taken into account by precedence constraints in the sequence of visits.…”

Section: Transportation Costsmentioning

confidence: 99%

See 3 more Smart Citations

Chapter 14: Vehicle Routing Applications in Disaster Relief

Golden¹,

Kovacs²,

Wasil³

2014

Vehicle Routing

View full text Add to dashboard Cite

The working assumption in most Vehicle Routing Problems (VRPs) is that profitable customer requests have to be processed at minimal cost. However, there are VRP applications where servicing a customer has no monetary benefit, but all available resources must be mobilized to provide the best possible service. These applications appear in the context of humanitarian relief, where the key principle is to prevent or alleviate human suffering. This chapter examines a class of problems that obey this principle, namely, VRPs in disaster relief operations.We define a disaster as an extraordinary event that can occur with or without limited forewarning and has devastating effects on the population. Disasters might have different causes: natural (e.g., earthquakes and hurricanes) or man made (e.g., terrorist attacks and industry disasters). Furthermore, one disaster may be the trigger for another, such as an earthquake leading to a tsunami and a tsunami causing an industrial accident. Regardless of the cause, disasters often bring destruction, suffering, and loss of lives at a level that cannot be managed by local emergency units. The severity of the impact on the victims depends on the event's magnitude and on two additional factors (International Federation of Red Cross and Red Crescent Societies [23]): the affected population's vulnerability, expressed as the inability to resist the hazard, and the available capacities to cope with the effects of the event. As local capacities are overwhelmed after a disaster, national and international aid agencies play an important role in providing the support that is required to alleviate the suffering. Even though local authorities are responsible for the relief operations, the aid agencies are heavily involved in the disaster management process. Their functions include deploying rescue teams and providing essential supplies such as water, food, and medicine to the affected regions.Research in the field of disaster relief routing can make important contributions to support aid agencies in their operational activities and eventually to help save lives.

show abstract

Section: Response Timementioning

confidence: 99%

Section: Response Timementioning

confidence: 99%

Section: Service Equitymentioning

confidence: 99%

Section: Transportation Costsmentioning

confidence: 99%

See 2 more Smart Citations

Chapter 14: Vehicle Routing Applications in Disaster Relief

Golden¹,

Kovacs²,

Wasil³

2014

Vehicle Routing

View full text Add to dashboard Cite

show abstract

“…Traveling salesman problem (TSP) is well-studied problem in the literature in terms of solution approaches and its variants [7][8][9][10][11]14]. Recently, new variant of TSP in the context of maritime transportation, called traveling salesman problem with draft limits (TSPDL) has been proposed [12].…”

Section: Introductionmentioning

confidence: 99%

A general variable neighborhood search variants for the travelling salesman problem with draft limits

et al. 2014

View full text Add to dashboard Cite

In this paper, we present two general variable neighborhood search (GVNS) based variants for solving the traveling salesman problem with draft limits (TSPDL), a recent extension of the traveling salesman problem. TSPDL arises in the context of maritime transportation. It consists of finding optimal Hamiltonian tour for a given ship which has to visit and deliver products to a set of ports while respecting the draft limit constraints. The proposed methods combine ideas in sequential variable neighborhood descent within GVNS. They are tested on a set of benchmarks from the literature as well as on a new one generated by us. Computational experiments show remarkable efficiency and effectiveness of our new approach. Moreover, new set of benchmarks instances is generated.

show abstract

An updated annotated bibliography on arc routing problems

Mourão

Pinto

2017

Networks

View full text Add to dashboard Cite

The number of arc routing publications has increased significantly in the last decade. Such an increase justifies a second annotated bibliography, a sequel to Corberán and Prins (Networks 56 (2010), 50–69), discussing arc routing studies from 2010 onwards. These studies are grouped into three main sections: single vehicle problems, multiple vehicle problems and applications. Each main section catalogs problems according to their specifics. Section 2 is therefore composed of four subsections, namely: the Chinese Postman Problem, the Rural Postman Problem, the General Routing Problem (GRP) and Arc Routing Problems (ARPs) with profits. Section 3, devoted to the multiple vehicle case, begins with three subsections on the Capacitated Arc Routing Problem (CARP) and then delves into several variants of multiple ARPs, ending with GRPs and problems with profits. Section 4 is devoted to applications, including distribution and collection routes, outdoor activities, post‐disaster operations, road cleaning and marking. As new applications emerge and existing applications continue to be used and adapted, the future of arc routing research looks promising. © 2017 Wiley Periodicals, Inc. NETWORKS, Vol. 70(3), 144–194 2017

show abstract

The hierarchical traveling salesman problem

Cited by 21 publications

References 8 publications

Chapter 14: Vehicle Routing Applications in Disaster Relief

Chapter 14: Vehicle Routing Applications in Disaster Relief

A general variable neighborhood search variants for the travelling salesman problem with draft limits

An updated annotated bibliography on arc routing problems

Contact Info

Product

Resources

About