Vehicle routing with a sparse feasibility graph

Article Abstract:

A sparse feasibility graph for modelling vehicle routing problems is described. The graph consists of two customers who are connected if and only if there is the possibility that they can be successive customers on a certain vehicle route. A sequential vehicle route construction heuristic algorithm for the graph was developed. A key characteristic of this algorithm is that it avoids isolating single customers or groups of customers.

Operations Research, Models, Usage, Feasibility studies, Route surveying

---

Minimizing the makespan for the flow shop scheduling problem with availability constraints

Article Abstract:

Scheduling of flow shop with availability constraints (FSPAC) is dealt with in this paper. A tabu search and a heuristic approach based on a genetic algorithm is proposed to approximately solve the makespan minimization problem.

Research and Development in the Social Sciences and Humanities, Management & Information Science, Management Science, Methods, Scheduling (Management), Genetic algorithms

---

Similar abstracts:

• Abstracts: Job-shop scheduling with processing alternatives. An efficient genetic algorithm for job shop scheduling with tardiness objectives
• Abstracts: Cooperative games with stochastic payoffs. An extension of the Tau-value to games with coalition structures. The structure of the set of equilibria for two person multicriteria games
• Abstracts: Vehicle routing problem with time windows and a limited number of vehicles. Problem structuring methods in action
• Abstracts: Fuzzy classification systems. Global optimization and multiknapsack: a percolation algorithm

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.