Search results for "SIMULATION"
showing 10 items of 5095 documents
Numerical solution of a multi-class model for batch settling in water resource recovery facilities
2017
In Torfs et al. (2017) a new unified framework to model settling tanks in water resource recovery facilities was proposed providing a set of partial differential equations (PDEs) modelling different settling unit processes in wastewater treatment such as primary and secondary settling tanks (PSTs and SSTs). The extension to a multi-class framework to deal with the distributed properties of the settling particles leads to a system of non-linear hyperbolic-parabolic PDEs whose solutions may contain very sharp transitions. This necessitates the use of a consistent and robust numerical method to obtain well-resolved and reliable approximations to the PDE solutions. The use of implicit–explicit …
Boundary Element Crystal Plasticity Method
2017
A three-dimensional (3D) boundary element method for small strains crystal plasticity is described. The method, developed for polycrystalline aggregates, makes use of a set of boundary integral equations for modeling the individual grains, which are represented as anisotropic elasto-plastic domains. Crystal plasticity is modeled using an initial strains boundary integral approach. The integration of strongly singular volume integrals in the anisotropic elasto-plastic grain-boundary equations are discussed. Voronoi-tessellation micro-morphologies are discretized using nonstructured boundary and volume meshes. A grain-boundary incremental/iterative algorithm, with rate-dependent flow and har…
The multiple vehicle pickup and delivery problem with LIFO constraints
2015
Abstract This paper approaches a pickup and delivery problem with multiple vehicles in which LIFO conditions are imposed when performing loading and unloading operations and the route durations cannot exceed a given limit. We propose two mixed integer formulations of this problem and a heuristic procedure that uses tabu search in a multi-start framework. The first formulation is a compact one, that is, the number of variables and constraints is polynomial in the number of requests, while the second one contains an exponential number of constraints and is used as the basis of a branch-and-cut algorithm. The performances of the proposed solution methods are evaluated through an extensive comp…
A two-slope achievement scalarizing function for interactive multiobjective optimization
2012
The use of achievement (scalarizing) functions in interactive multiobjective optimization methods is very popular, as indicated by the large number of algorithmic and applied scientific papers that use this approach. Key parameters in this approach are the reference point, which expresses desirable objective function values for the decision maker, and weights. The role of the weights can range from purely normalizing to fully preferential parameters that indicate the relative importance given by the decision maker to the achievement of each reference value. Technically, the influence of the weights in the solution generated by the achievement scalarizing function is different, depending on …
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…
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…
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.
Large multiple neighborhood search for the clustered vehicle-routing problem
2018
Abstract The clustered vehicle-routing problem is a variant of the classical capacitated vehicle-routing problem in which customers are partitioned into clusters, and it is assumed that each cluster must have been served completely before the next cluster is served. This decomposes the problem into three subproblems, i.e., the assignment of clusters to routes, the routing inside each cluster, and the sequencing of the clusters in the routes. The second task requires the solution of several Hamiltonian path problems, one for each possibility to route through the cluster. We pre-compute the Hamiltonian paths for every pair of customers of each cluster. We present a large multiple neighborhood…
A comparison of column-generation approaches to the Synchronized Pickup and Delivery Problem
2015
Abstract In the Synchronized Pickup and Delivery Problem (SPDP), user-specified transportation requests from origin to destination points have to be serviced by a fleet of homogeneous vehicles. The task is to find a set of minimum-cost routes satisfying pairing and precedence, capacities, and time windows. Additionally, temporal synchronization constraints couple the service times at the pickup and delivery locations of the customer requests in the following way: a request has to be delivered within prespecified minimum and maximum time lags (called ride times) after it has been picked up. The presence of these ride-time constraints severely complicates the subproblem of the natural column-…
A heuristic for fast convergence in interference-free channel assignment using D1EC coloring
2010
This work proposes an efficient method for solving the Distance-1 Edge Coloring problem (D1EC) for the assignment of orthogonal channels in wireless networks with changing topology. The coloring algorithm is performed by means of the simulated annealing method, a generalization of Monte Carlo methods for solving combinatorial problems. We show that the simulated annealing-based coloring converges fast to a suboptimal coloring scheme. Furthermore, a stateful implementation of the D1EC scheme is proposed, in which network coloring is executed upon topology changes. The stateful D1EC is also based on simulated annealing and reduces the algorithm’s convergence time by one order of magnitude in …