Search results for "Mathematical optimization"
showing 10 items of 1300 documents
Fuzzy green vehicle routing problem for designing a three echelons supply chain
2020
Abstract In this study, a three-echelon fuzzy green vehicle routing problem (3E-FGVRP) is considered for designing a regional agri-food supply chain on a time horizon. To account for the variability associated with the quantities requested by customers, it is assumed that the demands are fuzzy numbers simulated by a time-dependent algorithm. Moreover, the vehicle fleet and distribution centres are considered with a defined capacity. The credibility theory of fuzzy sets is used to implement a multi-objective fuzzy chance-constrained programming model, where the total costs and carbon emissions are minimised. The resolution of the 3E-FGVRP is conducted by using a non-dominated sorting genetic…
Dynamic programming and Munkres algorithm for optimal photovoltaic arrays reconfiguration
2015
Abstract In this paper, an original formulation of the control problem for optimal PV array reconfiguration, following a Total Cross Tied layout, is proposed. The formulation follows the well-known subset sum problem, which is a special case of the knapsack problem. The reconfiguration is a measure devoted to mitigate the mismatch effect and maximize the output power of small photovoltaic plants under non-homogeneous working conditions. Therefore, reconfiguration means changing the connections of the solar panels adaptively by a dynamic switching matrix. The control system implements an easy dynamic programming algorithm to change the switches layout. The use of the Munkres assignment metho…
Partially Renewable Resources
2014
In recent years, in the field of project scheduling the concept of partially renewable resources has been introduced. Theoretically, it is a generalization of both renewable and non-renewable resources. From an applied point of view, partially renewable resources allow us to model a large variety of situations that do not fit into classical models, but can be found in real problems in timetabling and labor scheduling. In this chapter we define this type of resource, describe an integer linear formulation and present some examples of conditions appearing in real problems which can be modeled using partially renewable resources. Then we introduce some preprocessing procedures to identify infe…
Multiple-Choice Balanced Allocation in (Almost) Parallel
2012
We consider the problem of resource allocation in a parallel environment where new incoming resources are arriving online in groups or batches.
Detecting Inclusions in Electrical Impedance Tomography Without Reference Measurements
2009
We develop a new variant of the factorization method that can be used to detect inclusions in electrical impedance tomography from either absolute current-to-voltage measurements at a single, nonzero frequency or from frequency-difference measurements. This eliminates the need for numerically simulated reference measurements at an inclusion-free body and thus greatly improves the method's robustness against forward modeling errors, e.g., in the assumed body's shape.
Linear Programming Based Methods for Solving Arc Routing Problems
2000
From the pioneering works of Dantzig, Edmonds and others, polyhedral (i.e. linear programming based) methods have been successfully applied to the resolution of many combinatorial optimization problems. See Junger, Reinelt & Rinaldi (1995) for an excellent survey on this topic. Roughly speaking, the method consists of trying to formulate the problem as a Linear Program and using the existing powerful methods of Linear Programming to solve it.
A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
2010
In this paper, we present an effective memetic algorithm for the vehicle routing problem with time windows (VRPTW). The paper builds upon an existing edge assembly crossover (EAX) developed for the capacitated VRP. The adjustments of the EAX operator and the introduction of a novel penalty function to eliminate violations of the time window constraint as well as the capacity constraint from offspring solutions generated by the EAX operator have proven essential to the heuristic's performance. Experimental results on Solomon's and Gehring and Homberger benchmarks demonstrate that our algorithm outperforms previous approaches and is able to improve 184 best-known solutions out of 356 instance…
Differential Evolution with Scale Factor Local Search for Large Scale Problems
2010
This chapter proposes the integration of fitness diversity adaptation techniques within the parameter setting of Differential Evolution (DE). The scale factor and crossover rate are encoded within each genotype and self-adaptively updated during the evolution by means of a probabilistic criterion which takes into account the diversity properties of the entire population. The population size is also adaptively controlled by means of a novel technique based on a measurement of the fitness diversity. An extensive experimental setup has been implemented by including multivariate problems and hard to solve fitness landscapes. A comparison of the performance has been conducted by considering a st…
Scheduling Multimodal Transportation Systems
2004
Abstract In this paper a Lagrangian based heuristic procedure for scheduling transportation networks is presented. The solution procedure schedules a single line at a time, possibly correcting the previous decisions at each step.
Optimal Switches in Multi–inventory Systems
2007
Given a switched multi-inventory system we wish to find the optimal schedule of the resets to maintain the system in a safe operating interval, while minimizing a function related to the cost of the resets. We discuss a family of instances that can be solved in polynomial time by linear programming. We do this by introducing a set-covering formulation with a totally unimodular constraint matrix.