On the combined maintenance and routing optimization problem

López-Santana, Eduyn Ramiro; Akhavan-Tabatabaei, Raha; Dieulle, Laurence; Labadie, Nacima; Medaglia, Andrés L.

doi:10.1016/j.ress.2015.09.016

Cited by 57 publications

(40 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The tactical planning is followed by operational planning, which is used to secure the routine course of activities, solving problems, failures and shortcomings. The maintenance plan determines the set of operations, time intervals, and resources (staff, supplies, and spare parts) necessary to conduct maintenance operations (Duffuaa 2000;López-Santana et al 2016). The decision-maker determines how many maintenance periods to allocate and when to start each of them in order to minimize the makespan, i.e., the completion time of the last job to be processed (Rustogi, Strusevich 2012).…”

Section: Previous Researchmentioning

confidence: 99%

Maintenance as a tool for increasing the efficiency of chemicaltechnological process

Branská¹,

Pecinová²,

Paták³

2016

9th International Scientific Conference “Business and Management 2016”

View full text Add to dashboard Cite

Reliability, flexibility and speed belong among particularly valued parameters of contractor. In manufacturing companies, the achievement thereof is significantly limited by the reliability of production equipment. The aim of the article is to analyze an applied production equipment maintenance system with heavily utilized production equipment, and to define guidelines for its improvement. A content analysis of information obtained in a primary qualitative research and a comparison with theoretical approaches made it possible to define an adequate combination of various types of maintenance, including methods and tools that are not primarily intended for the examined type of manufacturing processes.

show abstract

Section: Previous Researchmentioning

confidence: 99%

Maintenance as a tool for increasing the efficiency of chemicaltechnological process

Branská¹,

Pecinová²,

Paták³

2016

9th International Scientific Conference “Business and Management 2016”

View full text Add to dashboard Cite

show abstract

“…This approach responds to a two-phase iterative method for the processes of replacement, maintenance, and scheduling of customer visits. The above, through the use of integer linear programming (MILP) and the presentation of a dynamic algorithm as a research extension to the work proposed by [2], which provides shorter response times and a similar level of efficiency in the comparison between both models. This paper focuses on the combinatorial model of maintenance and routing with time windows (CMR).…”

Section: Introductionmentioning

confidence: 99%

Proposal of a Dynamic Algorithm for the Maintenance and Vehicle Routing Problem with Time Windows

Ayala

Valbuena

López-Santana

2022

Ing.

View full text Add to dashboard Cite

Context: In the context of business organizations, every process in which the product is immersed has a cost and time associated with it. The area of maintenance planning and scheduling is no exception; however, it is an aspect in which few companies specialize, tending to be outsourced. In this sense, the application of combinatorial models is a tool with a high potential to improve the overall performance of the organization through the understanding of the integral maintenance process. Method: A two-phase (maintenance and routing) dynamic algorithm is proposed which considers a set of clients distributed in a maintenance network (distance), where each of the technicians start from the same central node (depot), which, in turn, is the endpoint of each assigned route. The objective is to minimize the total cost associated with the development of preventive and corrective maintenance of all machines to be evaluated. With this purpose, the formulation of the mathematical problem for each of the phases and its interrelation method is proposed. Then, performance measures are expressed to evaluate the achieved objectives. Results: The results satisfy a consistent alternative for the resolution of problems of the NP-Hard type, which generates a high level of complexity to the model. That is, it proposes a tool for solving problems of these characteristics in low computational response times and with appealing results. Conclusions: The combined maintenance and routing model using a dynamic algorithm addresses the maintenance and routing problem satisfactorily. The model shows good results with respect to the comparison optimization model in percentage gaps of performance measures lower than 5%. As for the computational time required, a reduction of up to 98% was achieved, which makes it an ideal alternative for highly complex scenarios. Finally, achieving a higher level of characterization, employing multi-objective decision criteria and a greater number of constraints to the problem, is proposed in future research. Acknowledgements: To the High-Performance Computing Center (CECAD - Centro de computación de Alto Desempeño) of Universidad Distrital Francisco José de Caldas for their support, as well as for providing us with a virtual machine to run the proposed mathematical model, which was an essential element in the results obtained.

show abstract

“…This is extended to the stochastic case in which activities are uncertain (Chen, Thomas, and Hewitt 2017). Another recent work discusses the combined maintenance and routing problem (López-Santana et al 2016), in which machines deteriorate stochastically over time. We acknowledge that those innovations in onshore applications may be of relevance for offshore wind maintenance service logistics.…”

Section: Introductionmentioning

confidence: 99%

A Branch-and-Price-and-Cut Algorithm for Resource-Constrained Pickup and Delivery Problems

Schrotenboer

Ursavas²,

Vis³

2019

Transportation Science

View full text Add to dashboard Cite

We study a multi-commodity multi-period resource constrained pickup-and-delivery problem inspired by the short-term planning of maintenance services at offshore wind farms. In order to begin a maintenance service, different types of relatively scarce servicemen need to be delivered (transported) to the service locations. We develop resource-exceeding route (RER) inequalities, which are inspired by knapsack cover inequalities, in order to model the scarcity of servicemen. In addition to a traditional separation approach, we present a column-dependent constraints approach so as to include the RER inequalities in the mathematical formulation. An alternative pricing strategy is developed to correctly include the column-dependent constraints. The resulting approach is broadly applicable to any routing problem that involves a set of scarce resources. We present a branch-and-price-and-cut algorithm to compare both approaches that include RER inequalities. The branch-and-price-and-cut algorithm relies on efficiently solving a new variant of the Elementary Resource Constrained Shortest Path Problem, using a tailored pulse algorithm developed specifically to solve it. Computational experiments show that the RER inequalities significantly tighten the root node relaxations. The column-dependent constraints approach searches then the branch and bound tree more effectively and appears to be competitive with the traditional separation procedure. Both approaches are able to solve instances of up to 92 nodes over 21 periods to optimality.

show abstract

On the combined maintenance and routing optimization problem

Cited by 57 publications

References 13 publications

Maintenance as a tool for increasing the efficiency of chemicaltechnological process

Maintenance as a tool for increasing the efficiency of chemicaltechnological process

Proposal of a Dynamic Algorithm for the Maintenance and Vehicle Routing Problem with Time Windows

A Branch-and-Price-and-Cut Algorithm for Resource-Constrained Pickup and Delivery Problems

Contact Info

Product

Resources

About