Constructive heuristic

A constructive heuristic is a type of heuristic method which starts with an empty solution and repeatedly, extends the current solution until a… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Railway crew scheduling problem is the process of allocating train services to the crew duties based on the published train… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • figure 3
Is this relevant?
2013
2013
This work presents a heuristic constructive algorithm which evaluates the optimal set of transmission expansion paths of an… (More)
  • table IV
  • table V
  • table VII
  • table VI
  • table IX
Is this relevant?
2012
2012
Finding a feasible timetable efficiently is crucial in a two-stage optimization algorithm. Heuristics adopted from graph coloring… (More)
  • figure 2
  • figure I
  • table I
  • table II
  • figure 3
Is this relevant?
2011
2011
In this paper, we propose an efficient rule-based heuristic to solve asset-based dynamic weapon-target assignment (DWTA) problems… (More)
  • figure 1
  • figure 2
  • figure 3
  • table II
Is this relevant?
2010
2010
A constructive heuristic algorithm (CHA) to solve distribution system planning (DSP) problem is presented. The DSP is a very… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
2009
2009
An optimization technique to solve distribution network planning (DNP) problem is presented. This is a very complex mixed binary… (More)
  • figure 1
  • table I
  • figure 2
  • figure 3
  • table II
Is this relevant?
2004
2004
In this paper a method for solving the short term transmission network expansion planning (STTNEP) problem is presented. The… (More)
  • table I
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2003
Highly Cited
2003
An extension to the classical vehicle routing problem where vehicles can be assigned more than one route within a working time… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • table 1
Is this relevant?
Highly Cited
1998
Highly Cited
1998
This paper presents a simple constructive heuristic (HFC) for the flowshop makespan problem which is capable of producing non… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
1993
1993
In this paper we consider constructive heuristic algorithms for the open shop problem with minimization of the schedule length… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?