Similar Search Results

The freight allocation problem with lane cost balancing constraint

Lim, Andrew; Qin, Hu; Xu, Zhou - In: European Journal of Operational Research 217 (2012) 1, pp. 26-35

We consider a problem faced by a buying office for one of the largest retail distributors in the world. The buying office plans the distribution of goods from Asia to various destinations across Europe. The goods are transported along shipping lanes by shipping companies, many of which have...

Persistent link: https://www.econbiz.de/10010574182

The Capacitated Team Orienteering Problem: A Bi-level Filter-and-Fan method

Tarantilis, C.D.; Stavropoulou, F.; Repoussis, P.P. - In: European Journal of Operational Research 224 (2013) 1, pp. 65-78

This paper focuses on vehicle routing problems with profits and addresses the so-called Capacitated Team Orienteering Problem. Given a set of customers with a priori known profits and demands, the objective is to find the subset of customers, for which the collected profit is maximized, and to...

Persistent link: https://www.econbiz.de/10010871271

A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages

Figielska, Ewa - In: European Journal of Operational Research 236 (2014) 2, pp. 433-444

In this paper we propose a heuristic for solving the problem of resource constrained preemptive scheduling in the two … minimization of makespan. The problem is NP-hard. The heuristic first sequences jobs on the machine at stage 1 and then solves the … sharing of the resources between the stages is taken into account is also derived. The performance of the heuristic evaluated …

Persistent link: https://www.econbiz.de/10010753509

An inventory–routing problem with the objective of travel time minimization

Li, Kunpeng; Chen, Bin; Sivakumar, Appa Iyer; Wu, Yong - In: European Journal of Operational Research 236 (2014) 3, pp. 936-945

In this paper, we consider an inventory–routing problem (IRP) in a large petroleum and petrochemical enterprise group. Compared to many other IRPs, the problem in this paper includes some special aspects due to the operational constraints, such as hours-of-service regulations of the company...

Persistent link: https://www.econbiz.de/10011097849

Integrating tabu search and VLSN search to develop enhanced algorithms: A case study using bipartite boolean quadratic programs

Glover, Fred; Ye, Tao; Punnen, Abraham P.; … - In: European Journal of Operational Research 241 (2015) 3, pp. 697-707

in the literature, except in a few isolated instances. In this paper, we develop efficient heuristic algorithms based on …

Persistent link: https://www.econbiz.de/10011117475

Construction and improvement algorithms for dispersion problems

Aringhieri, Roberto; Cordone, Roberto; Grosso, Andrea - In: European Journal of Operational Research 242 (2015) 1, pp. 21-33

Given a set N, a pairwise distance function d and an integer number m, the Dispersion Problems (DPs) require to extract from N a subset M of cardinality m, so as to optimize a suitable function of the distances between the elements in M. Different functions give rise to a whole family of...

Persistent link: https://www.econbiz.de/10011117478

The Clustered Orienteering Problem

Angelelli, E.; Archetti, C.; Vindigni, M. - In: European Journal of Operational Research 238 (2014) 2, pp. 404-414

approaches for the COP: an exact and a heuristic one. The exact approach is a branch-and-cut while the heuristic approach is a …

Persistent link: https://www.econbiz.de/10010871258

Iterated tabu search for the circular open dimension problem

Fu, Zhanghua; Huang, Wenqi; Lü, Zhipeng - In: European Journal of Operational Research 225 (2013) 2, pp. 236-243

This paper investigates the circular open dimension problem (CODP), which consists of packing a set of circles of known radii into a strip of fixed width and unlimited length without overlapping. The objective is to minimize the length of the strip. In this paper, CODP is solved by a series of...

Persistent link: https://www.econbiz.de/10011052401

Bayesian variable selection in generalized linear models using a combination of stochastic optimization methods

Fouskakis, D. - In: European Journal of Operational Research 220 (2012) 2, pp. 414-422

In this paper the usage of a stochastic optimization algorithm as a model search tool is proposed for the Bayesian variable selection problem in generalized linear models. Combining aspects of three well known stochastic optimization algorithms, namely, simulated annealing, genetic algorithm and...

Persistent link: https://www.econbiz.de/10011052443

Vehicle routing with multiple deliverymen: Modeling and heuristic approaches for the VRPTW

Pureza, Vitória; Morabito, Reinaldo; Reimann, Marc - In: European Journal of Operational Research 218 (2012) 3, pp. 636-647

. The performance of the model and the heuristic approaches are evaluated using instances generated from a set of classic …

Persistent link: https://www.econbiz.de/10011052494