A good approximation of the inventory level in a perishable inventory system
A good approximation of the inventory level in a (Q, r) perishable inventory system
This paper derives a good approach to approximating the expected inventory level per unit time for the continuous review (Q, r) perishable inventory system. Three existing approximation approaches are examined and compared with the proposed approach. Three stockout cases, including the full backorder, the partial backorder, and the full lost sales cases, which customers or material users generally use to respond to a stockout condition are considered. This study reveals the fact that the...
A gradient-type algorithm for the numerical solution of two-player zero-sum differential game problems
A Gradient-Type Method for the Equilibrium Programming Problem With Coupled Constraints
A Group Decision-Making Aggregation Process
A heuristic approach for determining lot sizes and schedules using power-of-two policy.
A heuristic column generation method for the heterogeneous fleet VRP
A heuristic column generation method for the heterogeneous fleet VRP
This paper presents a heuristic column generation method for solving vehicle routing problems with a heterogeneous fleet of vehicles. The method may also solve the fleet size and composition vehicle routing problem and new best known solutions are reported for a set of classical problems. Numerical results show that the method is robust and efficient, particularly for medium and large size problem instances.
A high accuracy method for solving ODEs with continuous right-hand side.
A hybrid algorithm for solving inverse problems in elasticity
A Hybrid Approach Combining Local Search and Constraint Programming for a Large Scale Energy Management Problem
This paper presents a heuristic approach combining constraint satisfaction, local search and a constructive optimization algorithm for a large-scale energy management and maintenance scheduling problem. The methodology shows how to successfully combine and orchestrate different types of algorithms and to produce competitive results. We also propose an efficient way to scale the method for huge instances. A large part of the presented work was done to compete in the ROADEF/EURO Challenge 2010, organized...
A hybrid approach for scheduling transportation networks
In this paper, we consider a regulation problem of an urban transportation network. From a given timetable, we aim to find a new schedule of multiple vehicles after the detection of a disturbance at a given time. The main objective is to find a solution maximizing the level of service for all passengers. This problem was intensively studied with evolutionary approaches and multi-agent techniques, but without identifying its type before. In this paper, we formulate the problem as a classical one...
A hybrid genetic algorithm for a dynamic logistics network with multi-commodities and components
Various topics related to reverse logistics have been discussed over the years. Most of them have assumed that facilities are kept open once they are established, and no returned products or recovery parts are stocked in intermediate recycling stations. However, firms may have the right to repeatedly open or close their facilities according to their economic benefits if they can acquire their facilities by lease. It also turns out that intermediate recycling stations like collection centers...
A hybrid genetic algorithm for a dynamic logistics network with multi-commodities and components
Various topics related to reverse logistics have been discussed over the years. Most of them have assumed that facilities are kept open once they are established, and no returned products or recovery parts are stocked in intermediate recycling stations. However, firms may have the right to repeatedly open or close their facilities according to their economic benefits if they can acquire their facilities by lease. It also turns out that intermediate recycling stations like collection centers...
A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints
This paper addresses a Three-Dimensional Loading Capacitated Vehicle Routing Problem (3L-CVRP) which combines a three-dimensional loading problem and vehicle routing problem in distribution logistics. The problem requires the combinatorial optimization of a feasible loading solution and a successive routing of vehicles to satisfy client demands, where all vehicles must start and terminate at a central depot. In spite of its clear practical significance...
A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints
This paper addresses a Three-Dimensional Loading Capacitated Vehicle Routing Problem (3L-CVRP) which combines a three-dimensional loading problem and vehicle routing problem in distribution logistics. The problem requires the combinatorial optimization of a feasible loading solution and a successive routing of vehicles to satisfy client demands, where all vehicles must start and terminate at a central depot. In spite of its clear practical significance...
A hybrid inertial projection-proximal method for variational inequalities.
A hybrid iterative scheme for variational inequality problems for finite families of relatively weak quasi-nonexpansive mappings.
A hybrid method for a countable family of multivalued maps, equilibrium problems, and variational inequality problems.
A hybrid projection-proximal point algorithm.