Journal: Journal of Mathematical Modelling and Algorithms

Found 153 papers in total
A queueing framework for routing problems with time-dependent travel times
2007,
Assigning and scheduling vehicle routes in a dynamic environment is a crucial...
Optimization models for forest road upgrade planning
2007,
Road blocking due to thawing or heavy rains annually contributes to a considerable...
Solving large-scale profit maximization capacitated lot-size problems by heuristic methods
2007,
This paper introduces a simple heuristic for a quadratic programming sub-problem...
Integrated shipment dispatching and packing problems: a case study
2007,
In this paper we examine a consolidation and dispatching problem motivated by a...
Optimal solutions in the multi-location inventory system with transshipments
2007,
We consider a single-period multi-location inventory system where inventory choices at...
Modelling and optimal receding-horizon control of maritime container terminals
2007,
The main objective of this paper consists in modelling, optimizing, and controlling...
Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices
2006,
Conditions imposed on the matrices of the Quadratic Assignment Problem (QAP) are...
Computing minimal forecast horizons: An integer programming approach
2006,
In this paper, we use integer programming (IP) to compute minimal forecast horizons...
Analysis of decomposition algorithms with Benders cuts for p-median problem
2006,
In this paper the algorithms for solving the p -median problem based on the Benders...
A decomposition method for transfer line life cycle cost optimisation
2006,
A new method is described to search best parameters of a transfer line so that the...
Scheduling equal processing time jobs to minimize the weighted number of late jobs
2006,
We prove that the problem {P|p i =p (all i), pmtn | ∑ i w i U i } is...
Analysis of fractional covering of some supply management problems
2006,
We study a supply management problem with a linear cost function and its mixed integer...
Models and complexity of multibin packing problems
2006,
This paper extends the previous work on multibin packing problems and gives a deeper...
The container transshipment problem: Searching representation landscapes with metaheuristic algorithms
2006,
The container transshipment problem involves scheduling a fleet of lorries to collect...
A hybrid meta-heuristic for the batching problem in just-in-time flow shops
2006,
This paper is concerned with a batching problem encountered in the context of...
COSEARCH: A parallel cooperative metaheuristic
2006,
In order to design a well-balanced metaheuristic for robustness, we propose the...
Hybridization of GRASP metaheuristic with data mining techniques
2006,
In this work, we propose a hybridization of GRASP metaheuristic that incorporates a...
Hybrid population-based algorithms for the bi-objective quadratic assignment problem
2006,
We present variants of an ant colony optimization (MO-ACO) algorithm and of an...
Neighborhood portfolio approach for local search applied to timetabling problems
2006,
A recent trend in local search concerns the exploitation of several different...
Hybrid metaheuristics for the vehicle routing problem with stochastic demands
2006,
This article analyzes the performance of metaheuristics on the vehicle routing problem...
One-dimensional cutting stock problem with a given number of setups: A hybrid approach of metaheuristics and linear programming
2006,
One-dimensional cutting stock problem (1D-CSP) is one of the representative...
A family of stochastic programming test problems based on a model for tactical manpower planning
2005,
Ariyawansa and Felt have recently created a test problem collection for testing...
Scheduling on a batch processing machine with split compatibility graphs
2005,
We consider the problem of minimizing the makespan on a batch processing machine, in...
Exact and heuristic algorithms for dynamic tree simplification
2005,
The Tree Knapsack Problem (TKP) is a (0–1) integer programming problem where...
Papers per page: