List of Articles Variable neighborhood search

• Open Access Article
  • Abstract Page
  • Full-Text
  
  1 - Bi-objective mathematical modeling for a green last-mile transportation network with an automated parcel locker
  Amir-Hossein Zahedi-Anaraki Reza Tavakkoli-Moghaddam Ramin Sadeghian
  The purpose of this paper is to introduce a more integrated and specialized approach to address the challenging issues known as the "Last-Mile Transportation" and to provide a conceptual-mathematical framework for making a synergy and integration between theoretical con More

  The purpose of this paper is to introduce a more integrated and specialized approach to address the challenging issues known as the "Last-Mile Transportation" and to provide a conceptual-mathematical framework for making a synergy and integration between theoretical concepts and classic urban logistics optimization issues. This is a two-echelon routing-location network consisting of an urban distributor (or warehouse), customers and potential locations to install two types of facilities (automated parcel locker and micro-distributor). After ordering based on their desirability, customers are able to receive their product at the door or at 24-hour parcel locker. A modified Bender decomposition algorithm is used to solve the proposed model, which is amplified by the strategy of rounding of master problem’s variables and local search. To prove the efficiency, we compared the properties obtained from the proposed algorithm with the results obtained from the epsilon-constraint method in the Python software environment, the CPLEX library and ILOG CPLEX Optimization Studio and the results confirms the absolute dominance of this method in large-sized instances. The results of the sensitivity analysis of the role of automated parcel lockers on the network’s cost and produced pollution indicate the efficiency and validity of the proposed model. Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  2 - Modeling and scheduling no-idle hybrid flow shop problems
  Mehdi Yazdani Bahman Naderi
  10.22094/joie.2016.261
  Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  3 - A Mathematical Model for Multiple-Load AGVs in Tandem Layout
  Behnam Rahimikelarijani Mohammad Saidi-Mehrabad Farnaz Barzinpour
  10.22094/joie.2018.537.37
  Manuscript profile
• Open Access Article
  • Abstract Page
  • Full-Text
  
  4 - Hybrid meta-heuristic algorithm for multi-objective portfolio optimization by fuzzy programming
  Javad Behnamian Mohammad Moshrefi
  Portfolio selection is one of the problems which is very important for the investors in the exchange market. In order to invest on several kinds of shares instead of a specific one so that they can earn maximum profit through a certain level of risk or have minimum risk More

  Portfolio selection is one of the problems which is very important for the investors in the exchange market. In order to invest on several kinds of shares instead of a specific one so that they can earn maximum profit through a certain level of risk or have minimum risk with a certain level of profit. What have been introduced concerning financial calculations and the choice of portfolio or selection of an investment up to now, in some ways, determines priority in accordance with degree of risk and rate of return respectively; so that the investor can select his favourite portfolio through financial facilities and other confronting policies. When the investor is faced with different properties, he should make decisions about the number of properties as well as the amount of investment. So in some ways, he faces uncertain decisions in his choices. We are considering fuzzy concepts in the discussion of portfolio selection optimization in order to pursue this uncertainty. Then by using Bonison method, we determine priority and preference among the portfolios so that the investor can decide without confusion and finally through introducing combined metaheuristic algorithm for variable neighbourhood search and genetics, can optimize the resulting model of previous process and comparing it with other solving algorithms. Manuscript profile