Privatized rural postman problems

Aráoz, Julián; Fernández, Elena; Zoltan, Cristina

doi:10.1016/j.cor.2005.02.013

Cited by 49 publications

(29 citation statements)

References 11 publications

(19 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…• References [2][3][4]14] propose models that maximize the total utility of the built routes, without violating the vehicle capacity or the time limit.…”

Section: Selecting Adequate Models For Our Proposalmentioning

confidence: 99%

Planning Ecotourism Routes in Nature Parks

Barrena

Laporte

Ortega

et al. 2016

SEMA SIMAI Springer Series

View full text Add to dashboard Cite

The main objective of the Nature Parks is to preserve the diversity and integrity of biotic communities for present and future use. Additionally, the Nature Parks can contribute to the invigoration of the sustainable development and culture heritage of its neighboring regions, as well as to the strengthening of the environmental education for visitors by means of direct experiences. From this double point of view, ecotourism is gaining acceptance as a tool for sustainable development since the income of visitors to protected areas can contribute significantly to support the economy of these areas and of the rural communities. This article proposes different methodologies for determining efficient routes of ecotourism where the main objective is the maximization of the cultural transmission experienced by the visitors along the path traveled. The models are formulated by using integer linear programming and its potential applicability is illustrated in the context of the Doñana

show abstract

“…• References [2][3][4]14] propose models that maximize the total utility of the built routes, without violating the vehicle capacity or the time limit.…”

Section: Selecting Adequate Models For Our Proposalmentioning

confidence: 99%

Planning Ecotourism Routes in Nature Parks

Barrena

Laporte

Ortega

et al. 2016

SEMA SIMAI Springer Series

View full text Add to dashboard Cite

show abstract

“…The Prize-collecting Rural Postman Problem (PRPP) was introduced by Aráoz et al [10] with the name Privatized Rural Postman Problem. The PRPP is the arc routing version of the TSP with profits.…”

Section: Other Rppmentioning

confidence: 99%

Recent results on Arc Routing Problems: An annotated bibliography

Corberán

Prins

2010

Networks

View full text Add to dashboard Cite

Arc routing problems are vehicle routing problems in which the tasks to be performed are located on some arcs or edges of a network, e.g., spreading salt on a road or collecting municipal refuse in a street. They have been much less studied than node routing problems but impressive developments have been achieved in the last decade. The objective of this article is to survey these recent results and to provide an annotated bibliography. Except for a few references, the period surveyed starts from the publication of the book "Arc routing: theory, solutions and applications", edited by Dror in 2000. The article is made up of two main parts: one on uncapacitated (single vehicle) problems derived from the Chinese Postman Problem, the Rural Postman Problem, and the General Routing Problem; and one on multivehicle or capacitated problems such as the Capacitated Arc Routing Problem.

show abstract

“…One must typically construct a tour in the given network that maximizes the sum of the collected prizes minus the travel cost. The polyhedral structure of this problem is described in Aráoz et al (2006), while Black et al (2013) consider an extension of the problem in which the arc prizes are time dependent.…”

Section: Related Literaturementioning

confidence: 99%

Solving the selective multi-category parallel-servicing problem

Range

Lusby

Larsen

2013

J Sched

View full text Add to dashboard Cite

Document VersionAbstract In this paper we present a new scheduling problem and describe a shortest path based heuristic as well as a dynamic programming based exact optimization algorithm to solve it. The Selective Multi-Category Parallel-Servicing Problem (SMCPSP) arises when a set of jobs has to be scheduled on a server (machine) with limited capacity. Each job requests service in a prespecified time window and belongs to a certain category. Jobs may be serviced partially, incurring a penalty; however, only jobs of the same category can be processed simultaneously. One must identify the best subset of jobs to process in each time interval of a given planning horizon while respecting the server capacity and scheduling requirements. We compare the proposed solution methods with a MILP formulation and show that the dynamic programming approach is faster when the number of categories is large, whereas the MILP can be solved faster when the number of categories is small.

show abstract

Privatized rural postman problems

Cited by 49 publications

References 11 publications

Planning Ecotourism Routes in Nature Parks

Planning Ecotourism Routes in Nature Parks

Recent results on Arc Routing Problems: An annotated bibliography

Solving the selective multi-category parallel-servicing problem

Contact Info

Product

Resources

About