Path-relinking

Resende, Maurício G. C.; Ribeiro, Celso C.

doi:10.1007/978-1-4939-6530-4_8

Cited by 5 publications

(5 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It finishes when both guide and base solutions are equal (Glover, 1997), or after exploring a maximum number of intermediate solutions (Resende et al., 2010). According to the studies of Resende and Ribeiro (2016), the direction of this exploration matters. In the forward path‐relinking , the changes come from the guide solution.…”

Section: Proposed Solution Methodsmentioning

confidence: 99%

“…Conversely, the algorithm is called backward path‐relinking when the changes come from the base solution. Resende and Ribeiro (2016) also propose the mixed path‐relinking , which combines both forward and backward strategies. According to their experiments, this mixed intensification approach often finds a better solution than the others.…”

Section: Proposed Solution Methodsmentioning

confidence: 99%

See 1 more Smart Citation

A biased random‐key genetic algorithm for the home health care problem

Araújo

Buriol

et al. 2022

Int Trans Operational Res

View full text Add to dashboard Cite

Home health care problems consist in scheduling visits to home patients by health professionals while following a series of requirements. This paper studies the Home Health Care Routing and Scheduling Problem, which comprises a multi‐attribute vehicle routing problem with soft time windows. Additional route inter‐dependency constraints apply for patients requesting multiple visits, either by simultaneous visits or visits with precedence. We apply a mathematical programming solver to obtain lower bounds for the problem. We also propose a biased random‐key genetic algorithm, and we study the effects of additional state‐of‐the‐art components recently proposed in the literature for this genetic algorithm. We perform computational experiment using a publicly available benchmark dataset. Regarding the previous local search‐based methods, we find results up to 26.1% better than those of the literature. We find improvements from around 0.4% to 6.36% compared to previous results from a similar genetic algorithm.

show abstract

Section: Proposed Solution Methodsmentioning

confidence: 99%

Section: Proposed Solution Methodsmentioning

confidence: 99%

A biased random‐key genetic algorithm for the home health care problem

Araújo

Buriol

et al. 2022

Int Trans Operational Res

View full text Add to dashboard Cite

show abstract

“…It finishes when both guide and base solutions are equal (Glover, 1997), or after exploring a maximum number of intermediate solutions (Resende et al, 2010). According to the studies of Resende and Ribeiro (2016), the direction of this exploration matters. In the forward path-relinking, the changes come from the guide solution.…”

Section: Implicit Path-relinking In Random-keys Spacementioning

confidence: 99%

“…Conversely, the algorithm is called backward path-relinking when the changes come from the base solution. Resende and Ribeiro (2016) also propose the mixed path-relinking, which combines both forward and backward strategies. According to their experiments, this mixed intensification approach often finds a better solution than the others.…”

Section: Implicit Path-relinking In Random-keys Spacementioning

confidence: 99%

A biased random-key genetic algorithm for the home health care problem

F.¹,

Araújo²,

Buriol³

et al. 2022

Preprint

Self Cite

View full text Add to dashboard Cite

Home health care problems consist of scheduling visits to home patients by health professionals while following a series of requirements. This paper studies the Home Health Care Routing and Scheduling Problem, which comprises a multi-attribute vehicle routing problem with soft time windows. Additional route inter-dependency constraints apply for patients requesting multiple visits, either by simultaneous visits or visits with precedence. We apply a mathematical programming solver to obtain lower bounds for the problem. We also propose a biased random-key genetic algorithm, and we study the effects of additional state-of-art components recently proposed in the literature for this genetic algorithm. We perform computational experiment using a publicly available benchmark dataset. Regarding the previous local search-based methods, we find results up to 26.1% better than those of the literature. We find improvements from around 0.4% to 6.36% compared to previous results from a similar genetic algorithm.

show abstract

“…For this reason, the third step of the proposed method proposes a mathematical model that selects the best subset of territories among those found by the feasible solutions of the heuristic to reduce the average number of expected late deliveries. This third step also contributes to a better use of the solutions found during the first phase and can be seen as a phase of search intensification similar to a common "path relinking" in many implementations of the GRASP metaheuristic [51].…”

Section: Combination Of Solutions Through Integer Programmingmentioning

confidence: 99%

A Districting Application with a Quality of Service Objective

Álvarez-Miranda

Pereira

2021

Mathematics

View full text Add to dashboard Cite

E-commerce sales have led to a considerable increase in the demand for last-mile delivery companies, revealing several problems in their logistics processes. Among these problems, are not meeting delivery deadlines. For example, in Chile, the national consumer service (SERNAC) indicated that in 2018, late deliveries represented 23% of complaints in retail online sales and were the second most common reason for complaints. Some of the causes are incorrectly designed delivery zones because in many cases, these delivery zones do not account for the demographic growth of cities. The result is an imbalanced workload between different zones, which leads to some resources being idle while others fail to meet their workload in satisfactory conditions. The present work proposes a hybrid method for designing delivery zones with an objective based on improving the quality of express delivery services. The proposed method combines a preprocess based on the grouping of demand in areas according to the structure of the territory, a heuristic that generates multiple candidates for the distribution zones, and a mathematical model that combines the different distribution zones generated to obtain a final territorial design. To verify the applicability of the proposed method, a case study is considered based on the real situation of a Chilean courier company with low service fulfillment in its express deliveries. The results obtained from the computational experiments show the applicability of the method, highlighting the validity of the aggregation procedure and improvements in the results obtained using the hybrid method compared to the initial heuristic. The final solution improves the ability to meet the conditions associated with express deliveries, compared with the current situation, by 12 percentage points. The results also allow an indicative sample of the critical service factors of a company to be obtained, identifying the effects of possible changes in demand or service conditions.

show abstract

Path-relinking

Cited by 5 publications

References 17 publications

A biased random‐key genetic algorithm for the home health care problem

A biased random‐key genetic algorithm for the home health care problem

A biased random-key genetic algorithm for the home health care problem

A Districting Application with a Quality of Service Objective

Contact Info

Product

Resources

About