Application of relax-and-fix heuristic in the aggregation of stands for tactical forest scheduling
Sign Up to like & getrecommendations! Published in 2020 at "Forest Policy and Economics"
DOI: 10.1016/j.forpol.2020.102284
Abstract: Abstract Tactical harvest scheduling is related to forest unit selection and spatial sequencing. Mixed Integer Linear Programming (MILP) is traditionally implemented in this type of planning, associating each forest unit with one or more binary… read more here.
Keywords: relax fix; application; forest; application relax ... See more keywords
A Relax-and-Fix Decomposition Strategy Based on Adjacent Nodes Applied to the Periodic Capacitated Arc Routing Problem (PCARP)
Sign Up to like & getrecommendations! Published in 2020 at "IEEE Latin America Transactions"
DOI: 10.1109/tla.2020.9082729
Abstract: Periodic Capacitated Arc Routing Problem (PCARP) is a combinatorial problem of hard resolution and due to its intrinsic intractability, researchers have concentrated on designing heuristic methods to obtain good quality solutions. In this work, the… read more here.
Keywords: decomposition; pcarp; problem; capacitated arc ... See more keywords
Multi-Period Service Scheduling Problems: A new model and heuristic approaches of relax-and-fix and fix-and-optimize
Sign Up to like & getrecommendations! Published in 2021 at "IEEE Latin America Transactions"
DOI: 10.1109/tla.2021.9468446
Abstract: Multi-Period Service Scheduling Problem MSSP is descibed as a category of problems that arise in the context of scheduling services. In these problems, customers have a periodic service to be attended, a finite number of… read more here.
Keywords: service; service scheduling; multi period; period service ... See more keywords