Search results

This paper aims to define the class of fragment constructive heuristics used to compute feasible solutions for the traveling salesman problem (TSP) into edge-greedy and vertex-greedy subclasses. As these subclasses of heuristics can create subtours, two known methodologies for subtour elimination on symmetric instances are reviewed and are expanded to cover asymmetric problem instances. This paper introduces a third novel subtour elimination methodology, the greedy tracker (GT), and compares it to both known methodologies.

Computational results for all three subtour elimination methodologies are generated across 17 symmetric instances ranging in size from 29 vertices to 5,934 vertices, as well as 9 asymmetric instances ranging in size from 17 to 443 vertices.

The results demonstrate the GT is the fastest method for preventing subtours for instances below 400 vertices. Additionally, a distinction between fragment constructive heuristics and the subtour elimination methodology used to ensure the feasibility of resulting solutions enables the introduction of a new vertex-greedy fragment heuristic called ordered greedy.

This research has two main contributions: first, it introduces a novel subtour elimination methodology. Second, the research introduces the concept of ordered lists which remaps the TSP into a new space with promising initial computational results.

The purpose of this paper is to outline the main features concerning the optimization of printed circuit board (PCB) fabrication by improving the manufacturing process productivity.

The author explored two different approaches to increase the manufacturing process productivity of PCBs. The first approach involved optimization of the PCB manufacturing process as a whole. The second approach was based on increasing the process productivity at the operational level.

To reduce the total manufacturing time, two heuristic algorithms for solving flowshop scheduling problems were designed. These algorithms were used for the computation of an optimal PCB manufacturing schedule. The case study shows both mono‐ and bi‐criteria optimization of the PCBs manufacturing.

While the input data used in the case study were based on random numbers, the mathematical considerations drew only the main directions for manufacturing process optimization.

The paper shows two original heuristic algorithms for solving the flowshop scheduling problem, with high performance according to the best heuristics in the field. Besides their performances, these algorithms have the advantage of simplicity and ease of implementation on a computer. Using these algorithms, the optimal schedule for the PCB manufacturing process was calculated. For the case of the bi‐criteria optimization, the study of points which belong to the Pareto‐optimal set are presented.

Hyper-heuristics are a class of high-level search techniques which operate on a search space of heuristics rather than directly on a search space of solutions. The purpose of this paper is to investigate the suitability of using genetic programming as a hyper-heuristic methodology to generate constructive heuristics to solve the multidimensional 0-1 knapsack problem

Early hyper-heuristics focused on selecting and applying a low-level heuristic at each stage of a search. Recent trends in hyper-heuristic research have led to a number of approaches being developed to automatically generate new heuristics from a set of heuristic components. A population of heuristics to rank knapsack items are trained on a subset of test problems and then applied to unseen instances.

The results over a set of standard benchmarks show that genetic programming can be used to generate constructive heuristics which yield human-competitive results.

In this work the authors show that genetic programming is suitable as a method to generate reusable constructive heuristics for the multidimensional 0-1 knapsack problem. This is classified as a hyper-heuristic approach as it operates on a search space of heuristics rather than a search space of solutions. To our knowledge, this is the first time in the literature a GP hyper-heuristic has been used to solve the multidimensional 0-1 knapsack problem. The results suggest that using GP to evolve ranking mechanisms merits further future research effort.

The purpose of this study is to first investigate the efficiency of the most commonly used performance measures for minimizing the number of workstations (NWs) in approaches addressing simple assembly line balancing problem (SALBP) for both straight and U-shaped line, and second to provide a comparative evaluation of 20 constructive heuristics to find solutions to the SALBP-1.

A total of 200 problems are solved by 20 different constructive heuristics for both straight and U-shaped assembly line. Moreover, several comparisons have been made to evaluate the performance of constructive heuristics.

Minimizing the smoothness index is not necessarily equivalent to minimizing the NWs; therefore, it should not be used as the fitness function in approaches addressing the SALBP-1. Line efficiency and the idle time are indeed reliable performance measures for minimizing the NWs. The most promising heuristics for straight and U-shaped line configurations for SALBP-1 are also ranked and introduced.

Results are expected to help scholars and industrial practitioners to better design effective solution methods for having the most balanced assembly line. This study will further help with choosing the most proper heuristic with regard to the problem specifications and line configuration.

There is limited research assessing the efficiency of the common objectives for SALBP-1. This study is among the first to prove that minimizing the workload smoothness is not equivalent to minimizing the NWs in SALBP-1 studies. This work is also one of the first attempts for evaluating the constructive heuristics for both straight and U-shaped line configurations.

This study aims to address the hybrid open shop problem (HOSP) with respect to the minimization of the overall finishing time or makespan. In the HOSP, we have to process n jobs in stages without preemption. Each job must be processed once in every stage, there is a set of m_k identical machines in stage k and the production flow is immaterial.

Computational experiments carried out on a set of randomly generated instances showed that the minimal idleness heuristic (MIH) priority rule outperforms the longest processing time (LPT) rule proposed in the literature and the other proposed constructive methods on most instances.

The proposed mathematical model outperformed the existing model in the literature with respect to computing time, for small-sized instances, and solution quality within a time limit, for medium- and large-sized instances. The authors’ hybrid iterated local search (ILS) improved the solutions of the MIH rule, drastically outperforming the models on large-sized instances with respect to solution quality.

The authors formalize the HOSP, as well as argue its NP-hardness, and propose a mixed integer linear programming model to solve it. The authors propose several priority rules – constructive heuristics based on priority measures – for finding feasible solutions for the problem, consisting of adaptations of classical priority rules for scheduling problems. The authors also propose a hybrid ILS for improving the priority rules solutions.

The purpose of this paper is to describe an integer linear programming model to schedule the maintenance crew and the maintenance tasks in a bus operating company.

The proposed methodology relies on an integer linear programming model that finds feasible maintenance schedules. It minimizes the costs associated with maintenance crew and the costs associated with unavailability. The model is applied in a real-world case study of a Portuguese bus operating company. A constructive heuristic approach is put forward, based on solving the maintenance scheduling problem for each bus separately.

The heuristic finds better solutions than the exact methods (based on branch-and-bound techniques) in a much lower computational time.

The results suggest the relevance of such heuristic approaches for maintenance scheduling in practice.

This proposed model is an effective decision-making support method that provides feasible maintenance schedules for the maintenance technicians and for the maintenance tasks in a fleet of buses. It also complies with several operational, technical and labour constraints.

This paper aims to propose two solution approaches to determine the number of ground transport vehicles that are required to ensure the on-time delivery of military equipment between origin and destination node pairs in some geographic region, which is an important logistics problem at the US Transportation Command.

The author uses a mathematical program and a traditional heuristic to provide optimal and near-optimal solutions, respectively. The author also compares the approaches for random, small-scale problems to assess the quality and computational efficiency of the heuristic solution, and also uses the heuristic to solve a notional, large-scale problem typical of real problems.

This work helps analysts identify how many ground transport vehicles are needed to meet cargo delivery requirements in any military theater of operation.

This research assumes all problem data is deterministic, so it does not capture variations in requirements or transit times between nodes.

This work provides prescriptive details to military analysts and decision-makers in a timely manner. Prior to this work, insights for this type of problem were generated using time-consuming simulation taking about a week and often involving trial-and-error.

This research provides new methods to solve an important logistics problem. The heuristic presented in this paper was recently used to provide operational insights about ground vehicle requirements to support a geographic combatant command and to inform decisions for railcar recapitalization within the US Army.

For any given customer, his/her profitability for a business enterprise can be estimated by the so-called customer lifetime value (CLV). One specific goal for many enterprises consists in maximizing the aggregated CLV associated with its set of customers. To achieve this goal, a company uses marketing resources (e.g. marketing campaigns), which are usually expensive.

This paper proposes a formal model of the Customer Life Value problem inspired by the uncapacitated facility location problem.

The computational experiments conducted by the authors illustrate the potential of the approach when compared with a standard (non-algorithm-supported) one.

The approach leads up to the economic trade-off between the volume of the employed resources and the aggregated CLV, i.e. the higher the number of resources utilized, but also the higher the cost of achieving this level of lifetime value. Hence, the number of resources to be “activated” has to be decided, and the effect of each of these resources on each CLV will depend upon how “close” the resource is from the corresponding customer (i.e. how large will the impact of the active resource on the customer).

In this study, we analyze the power of the individual return-to-volatility security performance heuristic (ri/stdi) to simplify the identification of securities to buy and, consequently, to form the optimal no short sales mean–variance portfolios. The heuristic ri/stdi is powerful enough to identify the long and shorts sets. This is due to the positive definiteness of the variance–covariance matrix – the key is to use the heuristic sequentially. At the investor level, the heuristic helps investors to decide what securities to consider first. At the portfolio level, the heuristic may help us find out whether it is a good idea to invest in equity to begin with. Our research may also help to integrate individual security analysis into portfolio optimization through improved security rankings.

The examination timetabling problem is an NP-hard problem. A large number of approaches for this problem are developed to find more appropriate search strategies. Hyper-heuristic is a kind of representative methods. In hyper-heuristic, the high-level search is executed to construct heuristic lists by traditional methods (such as Tabu search, variable neighborhoods and so on). The purpose of this paper is to apply the evolutionary strategy instead of traditional methods for high-level search to improve the capability of global search.

This paper combines hyper-heuristic with evolutionary strategy to solve examination timetabling problems. First, four graph coloring heuristics are employed to construct heuristic lists. Within the evolutionary algorithm framework, the iterative initialization is utilized to improve the number of feasible solutions in the population; meanwhile, the crossover and mutation operators are applied to find potential heuristic lists in the heuristic space (high-level search). At last, two local search methods are combined to optimize the feasible solutions in the solution space (low-level search).

Experimental results demonstrate that the proposed approach obtains competitive results and outperforms the compared approaches on some benchmark instances.

The contribution of this paper is the development of a framework which combines evolutionary algorithm and hyper-heuristic for examination timetabling problems.