Abstract
In this paper, we discuss fully fuzzy linear fractional programming (FFLFP) problems under fuzzy nature with triangular fuzzy numbers. We recommend a simple method for the solution of FFLFP ...problems which preserves the fuzzy nature of the problem. The efficiency of the method proposed is illustrated with an example.
A key element to enhance urban distribution is the adequate management of parking space, particularly for loading and unloading operations. An in-advance booking system able to be adjusted to users ...needs can be a very useful tool for city councils. Such a tool should be fed with criteria for allocating requests to time slots. In this paper we discuss alternative criteria for the parking slot assignment problem for urban distribution and we propose the use of mathematical programming formulations to model them. Several models are proposed, analyzed and compared among them. Extensive computational experience is presented with a detailed analysis and comparison, which provides quantitative indicators of the quality of each of the proposed models.
•We define the parking slot problem assignment for urban distribution.•We propose alternative models according to different optimization criteria.•Extensive computational results are presented and analyzed.•Quantitative indicators of the quality of each model are introduced.
On the basis of arcwise connected convex functions and (p, r) −η - invex functions, we established Hb –(p, r) –η- invex functions. Based on the generalized invex assumption of new functions, the ...solutions of a class of multiobjective fractional programming problems are studied, and the sufficient optimality condition for the feasible solutions of multiobjective fractional programming problems to be efficient solutions are established and proved.
In this paper, a class of E-differentiable multiobjective programming problems with both inequality and equality constraints is considered. The so-called vector Mond-Weir E-dual problem and vector ...mixed E-duality problem are defined for the considered E-differentiable multiobjective programming problem with both inequality and equality constraints and several Mond-Weir and mixed E-duality theorems are established under (generalized) E-invexity hypotheses.
The problems of modeling the signal and dispersion properties of a second order recursive section in the integer parameter space are considered. The formulation and solution of the section synthesis ...problem by selective and dispersive criteria using the methods of integer nonlinear mathematical programming are given. The availability of obtaining both positive and negative frequency dispersion of a signal in a recursive section, as well as the possibility of minimizing dispersion distortions in the system, is shown.
The Flexible Periodic Vehicle Routing Problem Archetti, Claudia; Fernández, Elena; Huerta-Muñoz, Diana L.
Computers & operations research,
09/2017, Volume:
85
Journal Article, Publication
Peer reviewed
Open access
•A Mathematical model for the Flexible Periodic Vehicle Routing Problem (FPVRP) is proposed.•A Load-based formulation is developed to solve the FPVRP.•A set of several inequalities are proposed to ...reinforce the load-based FPVRP formulation.•A Load-based formulation for the Periodic Vehicle Routing Problem (PVRP) and a load-based formulation for the Flexible Periodic Vehicle Routing Problem with InventoryConstraints (FPVRP-IC) are proposed for a fair comparison in the computational experience.•A computational experience was carried out in order to show that FPVRP formulation outperforms PVRP and FPVRP-IC formulations in terms of solution quality.
Display omitted
This paper introduces the Flexible Periodic Vehicle Routing Problem (FPVRP) where a carrier has to establish a distribution plan to serve his customers over a planning horizon. Each customer has a total demand that must be served within the horizon and a limit on the maximum quantity that can be delivered at each visit. A fleet of homogeneous capacitated vehicles is available to perform the services and the objective is to minimize the total routing cost. The FPVRP can be seen as a generalization of the Periodic Vehicle Routing Problem (PVRP) which instead has fixed service frequencies and schedules and where the quantity delivered at each visit is fixed. Moreover, the FPVRP shares some common characteristics with the Inventory Routing Problem (IRP) where inventory levels are considered at each time period and, typically, an inventory cost is involved in the objective function. We present a worst-case analysis which shows the advantages of the FPVRP with respect to both PVRP and IRP. Moreover, we propose a mathematical formulation for the problem, together with some valid inequalities. Computational results show that adding flexibility improves meaningfully the routing costs in comparison with both PVRP and IRP.
We provide a condensed and selective look at the known landscape of the theory and application of Fuzzy optimization, emphasizing Professors' Tanaka and Asai contribution. Significant ideas are ...picked out in the trajectory of this field and projections are made for its future developments. From our discussions, it unquestionably emerges that the above mentioned Japanese academics have played a noticeable role in shaping the subject from its genesis to its maturation. Moreover, their research work will continue to inspire prospective works in this field.
PDF
