Two improved formulations for the minimum latency problem

Alvarez, Ada M.; García, Irma

doi:10.1016/j.apm.2012.05.026

Cited by 38 publications

(20 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Because of the unsuccessful implementation of the adapted MTVRP models, we decided to explore models developed for latency problems, even though they do not allow more than one route per vehicle (Picard and Queyranne, 1978;Gouveia and Voss, 1995;Angel-Bello et al, 2013). Specifically, Models I and II below generalize formulations developed for the MLP with a single route (Angel-Bello et al, 2013).…”

Section: Latency-based Formulationsmentioning

confidence: 99%

“…Specifically, Models I and II below generalize formulations developed for the MLP with a single route (Angel-Bello et al, 2013).…”

Section: Latency-based Formulationsmentioning

confidence: 99%

“…Recently, for the MLP, new and improved mixed integer reformulations have been proposed (Méndez-Díaz et al, 2008;Angel-Bello et al, 2013) and exact methods have been developed based on cutting plane (Méndez-Díaz et al, 2008) and on Branch-and-Cut-and-Price (Abeledo et al, 2013).…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A customer-centric routing problem with multiple trips of a single vehicle

Martínez-Salazar

Alvarez

2015

Journal of the Operational Research Society

Self Cite

View full text Add to dashboard Cite

In this study, we introduce a routing problem with multiple uses of a single vehicle and service time in demand points, minimizing the sum of clients' waiting time to receive service. This problem is relevant in the distribution of aid in disaster-stricken communities, in the recollection and/or delivery of perishable goods and personnel transportation, among other situations, where reaching clients to perform service, fast and fair, is a priority. We consider vehicle capacity and travel distance constraints, forcing multiple use of the vehicle during the planning horizon. This paper presents two mixed integer formulations for this problem, based on a multi-level network, as well as a metaheuristic algorithm. The proposed models can solve to optimality instances with up to 30 clients. The proposed metaheuristic algorithm obtains high-quality solutions in short computational times.

show abstract

Section: Latency-based Formulationsmentioning

confidence: 99%

“…Specifically, Models I and II below generalize formulations developed for the MLP with a single route (Angel-Bello et al, 2013).…”

Section: Latency-based Formulationsmentioning

confidence: 99%

See 1 more Smart Citation

A customer-centric routing problem with multiple trips of a single vehicle

Martínez-Salazar

Alvarez

2015

Journal of the Operational Research Society

Self Cite

View full text Add to dashboard Cite

show abstract

“…In addition, the routing problem associated with the context of this work also presents an important particularity: the service time in each service location, which is exactly the estimated service time for resolution. It follows that the dispatch problem is closed to the problem of minimum latency [6].…”

Section: Service Restoration By Repair Crewsmentioning

confidence: 99%

Resource Planning to Service Restoration in Power Distribution Systems

Schmitz¹,

Silva²,

Garcia³

et al. 2017

System Reliability

View full text Add to dashboard Cite

Whenever there are extreme weather events, electric power distribution systems are generally affected largely because they are highly subject by their constructive nature: overhead networks. In this context, the management of maintenance actions is generally referred to as emergency service order, usually associated with a lack of supply and requiring human intervention. The key issue for the resource planning refers to an estimation of service time that allows for more assertive planning possible. This chapter proposes a predictive modelling of emergency services for resource planning when considering the geographic dispersion of such services and also the time windows that comprise the amount of service time demanded. After presenting the methodological procedures, a case study depicts the application of the proposed method in order to support proactive service routing.

show abstract

“…With respect to reformulations, one may find quite a few references in the literature proposing reformulations for already proposed problems that provide tighter bounds (some examples can be found in Gouveia and Voß [1995] and García [2013]). In addition, in some combinatorial optimization problem families one is confronted with several formulations; this is the case regarding the lot-sizing problem family.…”

Section: Literature Reviewmentioning

confidence: 99%

A set partitioning reformulation for the multiple-choice multidimensional knapsack problem

Voß

Lalla-Ruiz

2015

Engineering Optimization

View full text Add to dashboard Cite

The Multiple-choice Multidimensional Knapsack Problem (MMKP) is a well-known N P-hard combinatorial optimization problem that has received a lot of attention from the research community as it can be easily translated to several real-world problems arising in areas such as allocating resources, reliability engineering, cognitive radio networks, cloud computing, etc. In this regard, an exact model that is able to provide high-quality feasible solutions for solving it or being partially included in algorithmic schemes is desirable. The MMKP basically consists of finding a subset of objects that maximizes the total profit while observing some capacity restrictions. In this article a reformulation of the MMKP as a set partitioning problem is proposed to allow for new insights into modelling the MMKP. The computational experimentation provides new insights into the problem itself and shows that the new model is able to improve on the best of the known results for some of the most common benchmark instances.

show abstract

Two improved formulations for the minimum latency problem

Cited by 38 publications

References 17 publications

A customer-centric routing problem with multiple trips of a single vehicle

A customer-centric routing problem with multiple trips of a single vehicle

Resource Planning to Service Restoration in Power Distribution Systems

A set partitioning reformulation for the multiple-choice multidimensional knapsack problem

Contact Info

Product

Resources

About