Loading [MathJax]/jax/output/SVG/jax.js
Research article Special Issues

Logistic models to minimize the material handling cost within a cross-dock

  • Received: 24 September 2022 Revised: 12 November 2022 Accepted: 21 November 2022 Published: 02 December 2022
  • Retail supply chains are intended to empower effectiveness, speed, and cost-savings, guaranteeing that items get to the end client brilliantly, giving rise to the new logistic strategy of cross-docking. Cross-docking popularity depends heavily on properly executing operational-level policies like assigning doors to trucks or handling resources to doors. This paper proposes a linear programming model based on door-to-storage assignment. The model aims to optimize the material handling cost within a cross-dock when goods are unloaded and transferred from the dock area to the storage area. A fraction of the products unloaded at the incoming gates is assigned to different storage zones depending on their demand frequency and the loading sequence. Numerical example considering a varying number of inbound cars, doors, products, and storage areas is analyzed, and the result proves that the cost can be minimized or savings can be intensified based on the feasibility of the research problem. The result explains that a variation in the number of inbound trucks, product quantity, and per-pallet handling prices influences the net material handling cost. However, it remains unaffected by the alteration in the number of material handling resources. The result also verifies that applying direct transfer of product through cross-docking is economical as fewer products in storage reduce the handling cost.

    Citation: Taniya Mukherjee, Isha Sangal, Biswajit Sarkar, Qais Ahmed Almaamari. Logistic models to minimize the material handling cost within a cross-dock[J]. Mathematical Biosciences and Engineering, 2023, 20(2): 3099-3119. doi: 10.3934/mbe.2023146

    Related Papers:

    [1] Huriye Kadakal . Hermite-Hadamard type inequalities for subadditive functions. AIMS Mathematics, 2020, 5(2): 930-939. doi: 10.3934/math.2020064
    [2] Salvador Cruz Rambaud, Fabrizio Maturo, Javier Sánchez García . Generalizing the concept of decreasing impatience. AIMS Mathematics, 2023, 8(4): 7990-7999. doi: 10.3934/math.2023403
    [3] Ghodratallah Fasihi-Ramandi, Hajar Ghahremani-Gol . Some geometric vector fields on 5-dimensional 2-step homogeneous nilmanifolds. AIMS Mathematics, 2020, 5(1): 546-556. doi: 10.3934/math.2020036
    [4] Xiao Wu, Qi Wang, Yinying Kong . Two-person zero-sum stochastic games with varying discount factors. AIMS Mathematics, 2021, 6(10): 11516-11529. doi: 10.3934/math.2021668
    [5] Andreea Bejenaru, Mihai Postolache . On a new nonlinear convex structure. AIMS Mathematics, 2024, 9(1): 2063-2083. doi: 10.3934/math.2024103
    [6] Haijun Cao, Fang Xiao . The category of affine algebraic regular monoids. AIMS Mathematics, 2022, 7(2): 2666-2679. doi: 10.3934/math.2022150
    [7] Shaoyuan Xu, Yan Han, Suzana Aleksić, Stojan Radenović . Fixed point results for nonlinear contractions of Perov type in abstract metric spaces with applications. AIMS Mathematics, 2022, 7(8): 14895-14921. doi: 10.3934/math.2022817
    [8] Pedro Fernández de Córdoba, Carlos A. Reyes Pérez, Enrique A. Sánchez Pérez . Mathematical features of semantic projections and word embeddings for automatic linguistic analysis. AIMS Mathematics, 2025, 10(2): 3961-3982. doi: 10.3934/math.2025185
    [9] Hongwu Li, Yuling Feng, Hongwei Jiao, Youlin Shang . A novel algorithm for solving sum of several affine fractional functions. AIMS Mathematics, 2023, 8(4): 9247-9264. doi: 10.3934/math.2023464
    [10] Ibrahim Al-Dayel, Meraj Ali Khan . Ricci curvature of contact CR-warped product submanifolds in generalized Sasakian space forms admitting nearly Sasakian structure. AIMS Mathematics, 2021, 6(3): 2132-2151. doi: 10.3934/math.2021130
  • Retail supply chains are intended to empower effectiveness, speed, and cost-savings, guaranteeing that items get to the end client brilliantly, giving rise to the new logistic strategy of cross-docking. Cross-docking popularity depends heavily on properly executing operational-level policies like assigning doors to trucks or handling resources to doors. This paper proposes a linear programming model based on door-to-storage assignment. The model aims to optimize the material handling cost within a cross-dock when goods are unloaded and transferred from the dock area to the storage area. A fraction of the products unloaded at the incoming gates is assigned to different storage zones depending on their demand frequency and the loading sequence. Numerical example considering a varying number of inbound cars, doors, products, and storage areas is analyzed, and the result proves that the cost can be minimized or savings can be intensified based on the feasibility of the research problem. The result explains that a variation in the number of inbound trucks, product quantity, and per-pallet handling prices influences the net material handling cost. However, it remains unaffected by the alteration in the number of material handling resources. The result also verifies that applying direct transfer of product through cross-docking is economical as fewer products in storage reduce the handling cost.



    The field of finance is characterized by a high dynamism and its strong relationship with other disciplines such as psychology, physics, sociology, marketing, etc. Additionally, mathematics (in particular, probability, statistics, topology and, even, geometry) has become an essential instrument to analyze and assess the main financial models. However, abstract algebra has been scarcely used when modeling the foundations of finance, that is to say, the principles of financial mathematics.

    In our opinion, this topic is very important because abstract algebra and financial mathematics deal with the grounds of mathematics and finance, respectively. Therefore, it is logical that a bridge between both disciplines should be built (see red arrow in Figure 1). On the other hand, the aforementioned dynamism exhibited by most financial instruments makes it necessary a flexible adaptation of axioms and structures describing the rational behavior of a decision maker in the real world.

    Figure 1.  Abstract algebra, financial mathematics and their relationships. Source: Own elaboration.

    Finally, the presence of mathematics is noteworthy in all disciplines and, undoubtedly, this can help to connect finance to the rest of scientific fields (see, again, Figure 1). More specifically, actions of semigroups (or A-modules, A-operands [4], A-acts [21], A-sets [23], A-systems [22] for A being a semigroup) represent a classical and fundamental notion in semigroup theory and category theory (see the above mentioned references). Moreover, this concept has applications to many areas of mathematics, computation (automata theory), criptography [26] and physics.

    In order to reach the objectives pointed out in this section, this paper is organized as follows. Section 2 provides a revision of the main interrelations between the research in intertemporal choice and other disciplines. After providing the preliminary concepts in Section 3, Section 4 analyzes the main binary relations in the context of intertemporal choice, by paying a special attention to the equivalence relation between dated rewards and its relationship with the additivity of discount functions. In this paper, we will use actions of semigroups in order to characterize additive discount functions (see propositions 1 and 3). Moreover, homomorphisms between two different actions are studied in this context (see Theorem 1). On the other hand, Corollary 1 is a nice result which characterizes separable discount function where the order of times acting on a reward does not matter (without needing that the discount function is additive). We hope that the approach to discount functions with actions will become a central reference in this topic. Although this paper has been focused on discount functions, the analysis of capitalization functions is analogous. Another interesting algebraic structure, related with discount functions, is quiver algebra, analyzed in Section 5. In this way, a characterization of additive discount functions is obtained by using this notion (see Proposition 5). Sections 6 and 7 introduce, respectively, novel structures of vector and affine spaces, associated to the map of indifference lines generated by a discount function. Specifically, Sections 6 is devoted to the description of the vector space constructed with the factors associated to a discount function Fd, where the benchmark d has been given. Finally, Section 7 describes the partial affine space (Ed) associated to the former vector space Vd (see Proposition 6), and the way to construct a reference system of the partial affine space and a change of reference with the complete discount function. Finally, Section 8 summarizes and concludes.

    In the context of intertemporal choice, discounting has shown to be an important topic with applications to many disciplines. In order to provide some real life examples of this model, the literature review is going to be summarized in different streams by following Figure 1.

    With respect to the relationship between psychology and financial mathematics (see Figure 1, in orange), we have to point out the analysis of the "anomalies" derived from the Discounted Utility Model: Delay effect [10,14], magnitude effect [15], sign effect, improving sequence effect [9,13,20], "peanuts effect" [16]. The study of these "paradoxes" is of great importance en Marketing, specifically in consumer's behavior.

    On the other hand, the subjective perception of time in intertemporal choice can be modeled by distorting the parameter "time" in a discount function [36]. In this way, Cruz Rambaud and Ventre [18] and Cruz Rambaud et al. [8] introduced the general concept of time deformation which derives from the more general definition of deformation in the area of abstract algebra. Specifically, Stevens [33] and Takahashi [35] proposed the so-called "power" and Weber-Fechner laws, respectively, which are particular cases of time deformations. Other concepts, shared by financial mathematics, psychology and pharmacology, are impulsiveness (or impatience) and inconsistency (or variation of impatience) (see [11,12]). In particular, the consideration of the so-called moderately and strongly decreasing impatience [32] gave rise to the novel concept of derivative of a differentiable real function F, relative to another function of two variables f (see [17]).

    Deforming time is also a usual topic in econophysics (see Figure 1, in green). In this way, the q-exponential discount function was already familiar to Bernoulli and Euler [25] and was already formalized in the periodic compound interest. However, this function has recently become well-known among nonextensive statistical theorists. Among them, Cajueiro [3] introduced the so-called q-exponential discount function as the reciprocal (with respect to the product of real-valued functions) of the q-exponential function, used in nonextensive thermodynamics [39]. Later, Cruz Rambaud and Muñoz Torrecillas [10] and Takeuchi [36] deformed the parameter "time" in the q-exponential discount function by using the Stevens "power" law, giving rise to the Weibull discount function. In this way, Cruz Rambaud et al. [8] endowed the set of deformations with the structure of monoid with which deforming time can be considered as an action of such monoid over the set of discount functions.

    In [31], the authors consider additive in contrast to multiplicative dynamics in analyzing games, from a dynamic perspective. In particular, the repetition of a gamble, additive or multiplicative, is investigated. Thus, we will follow the ideas on ergodicity economics*, presented by [29], as time is essential in our model. In this way, we can state that our approach to discount functions is dynamic.

    *Ergodicity economics (see [30]) seeks to build realistic models of its temporal evolution. The main concepts are the growth optimality, the maximization of the time average growth, and the choice of suitable utility functions. In particular, when the utility function follows a Brownian motion with an invertible drift, optimizing expected changes in utility functions is equivalent to optimizing the time average growth. Moreover, starting from given dynamics, we can determine the existence of an associated utility function.

    Adamou et al. [2] introduced the so-called Riskless Intertemporal Payment Problem (RIPP) where the decision maker compares the growth rates of the wealth arising from each payment and chooses the payment with the higher growth rate. This methodology is based on three items: the decision maker's existing wealth, the wealth dynamics, and the time frame, giving rise to four scenarios: no discounting, exponential, hyperbolic and hybrid discounting. More specifically, these scholars proposed a general riskless model with no behavioral biases:

    x(t)=f(gt),

    where x(t) denotes the wealth at time t, f the growth function, and g the growth rate. In particular, these models can adopt:

    ● A multiplicative dynamics (wealth grows exponentially in time, e.g., investing in income-generating assets):

    x(t):=x(t0)exp{g(tt0)}.

    ● An additive dynamics (wealth grows linearly in time, e.g., net income from employment at a given salary with stable consumption costs):

    x(t):=x(t0)+g(tt0).

    Starting from the following expression for g:

    g=x(t+Δt)x(t)Δt,

    instead of

    g=lnx(t+Δt)lnx(t)Δt,

    one can derive the discount rate for two alternatives a and b with the restriction ga=gb (denoted by ab):

    δ(D;H):=ΔxaΔxb|ab,

    where D is the delay and H the horizon. In this setting, the future trajectories of each payment is essential to solve the temporal choice problem by distinguishing between the so-called fixed and adaptive time frames, giving rise to different cases of preference reversals.

    Personal wealth is, apart from data on amounts and delays, one of the elements which define the discount function. From now on, the reasoning will be focused on the q-exponential function:

    eρnq:=[1(1q)ρn]1/(1q),

    which generalizes the exponential, hyperbolic and quasi-hyperbolic discounting. According to Nascimento [19], three physical aspects have to be taken into account when dealing with personal wealth (see Figure 1):

    ● The impact of payments on personal wealth [2], analyzed by using the following ratios:

    Xm:=mW0

    and

    XM:=MW0.

    ● The relative frequency between rewards.

    ● The contrast between time averages.

    The second aforementioned item transforms the intertemporal choice in a stochastic growth problem. In effect, when unexpected every-days situations require an analysis without testable information, the uniform distribution maximizes the uncertainty. If payments can be delayed beyond the deadlines, then the cumulative probabilities (Pm and PM) increase their entropy, reaching the value 1 later, being the probabilities at this moment:

    pm=Pm(t0+δt)

    and

    pM=PM(t0+δt).

    With respect to the third item, let τ(u) be the total time when GFΘM ("it will always be the case that I will at some time receive M") affirms that ΘM is true, and u the total time when GθM ("it will always be the case that I will receive an amount less than M") affirms that θM is true. In this case, one has:

    (1+xM)u=(1+XM)τ(u).

    In the case of a one-time payment, usually (1+XM)pM>(1+Xm)pm, whereby the decision criterion will be:

    Dc=max{(1+MW0)pM,(1+mW0)pm}=(1+MW0)pM.

    Thus, payments with a low impact on wealth allow an additive dynamics because the time average does not change significantly between the first and the n-th periods:

    1+Xm(1+nXm)1/n,

    for 0<Xm<<1. Analogously, for an exponential discounter, one has:

    (1+Xm)pmexp{pmXm},

    for 0<Xm<<1.

    A first attempt to describe the grounds of finance with purely algebraic tools (see Figure 1, in blue) was provided by Torrecillas Jover and Cruz Rambaud [38] who used inverse limits to describe the evolution of a discount function through time. This approach makes it possible a general perspective of the main discounting models in the context of intertemporal choice. Later, Cruz Rambaud [5] defined a discount function as an algebraic automaton. This approach allows a very general concept of discount function able to describe any variant of the real practices performed by financial agents.

    Finally, abstract algebra, and particularly algebraic automata, has been used to analyze the properties and characterizations of accounting systems (see [6,7,27,28]).

    The progression of illnesses and addictions in connection with their treatment (see Figure 1, in yellow) can be described as discount functions [12] by considering that the "discounted disease" depends on three possible explanatory variables: the level of dose, the frequency of administration and the time to assess the (non)monetary rewards, all other things being the same. Thus, the level of disease is superadditive for an interval and subadditive otherwise. This is the case of the so-called exponentiated hyperbolic discount function:

    F(t)=11+itk,

    where i>0 and k>1.

    In Marketing, discount appears when analyzing the optimal timing and depth of retail discounts with the optimal timing and the quantity of the retailer's order over multiple brands and time periods [37]. Here, discount is the list price minus the actual price of the brand that day for each brand. Sun et al. [34] showed that there exists a negative and significant relation between investor sentiment and pension plan discount rate. This finding is very important for boards of directors and regulators during periods of high investor sentiment when pension plan sponsors are more likely to adjust down pension discount rate. Finally, Liu et al. [24] introduced a price discount, announced after a normal price, for the next period by promotions or coupons, in the context of the profit risk of the supply chain due to dual uncertain information.

    As shown by this literature revision, the methodological foundations of intertemporal choice can be applied to many other disciplines such as psychology and pharmacology. Reciprocally, the mathematical tools used in other fields, such as physics, can be implemented in economics, giving rise to the so-called econophysics. This stream of methodological techniques between scientific disciplines makes it necessary the algebraic treatment of intertemporal choice in order to adequately analyze one of its central concepts, viz the additivity of the involved discount function or, equivalently, the transitivity of preferences.

    Additivity is closely related to the other central concept in every discounting model: the instantaneous discount rate. In effect, in a stationary environment, the additivity of the discount function is equivalent to require that the instantaneous discount rate is constant. Moreover, these two conditions are equivalent to the absence of preference reversals. At this point, it is necessary to take into account that this last condition is the origin of almost all anomalies in the ambit of intertemporal choice and the description of subadditive (or superadditive) treatments in diseases and addictions.

    Additivity of discount functions (or, equivalently, transitivity of preferences) takes part of the normative theory presented in the Discounted Utility (DU) model by Samuelson. Indeed, this is the core idea around which all observed behaviors revolve. Thus, taking into account the wide variety of perspectives from which intertemporal choice can be analyzed, additivity deserves a pure treatment, far from the particular features of the disciplines displayed in Figure 1.

    Let M be the set X×D×T, where X=[0,+), D=(,+) and T=[0,+].

    Definition 1. A dynamic discount function is a real-valued continuous function

    F:MX

    such that

    (x,d,t)F(x,d,t),

    where F(x,d,t) represents the value at d (called delay, focal date or benchmark) of a $x reward available at instant d+t. In order to make financial sense, this function must satisfy the following conditions:

    1. For every xX and every dD, F(x,d,0)=x.

    2. For every dD and every tT, F(0,d,t)=0.

    3. F(x,d,t) is strictly increasing with respect to x.

    4. F(x,d,t) is strictly decreasing with respect to t.

    Observe the different nature of each variable involved in this definition: dD is a calendar time, tT is a period of time, and xX and F(x,d,t)X are amounts.

    Remark 1. Sometimes, F is not defined for every (x,d,t)M. In such case, the maximal subset of M whose elements satisfy conditions 1, 2, 3 and 4 of Definition 1, will be called the domain of the discount function, denoted by dom(F).

    Example 1. The domain of the discount function F(x,d,t)=x(1kxdt), where dR+ and k>0, is:

    dom(F)={(x,d,t):xX,dR+,t[0,1kxd[}.

    Usually, the discount function is linear with respect to x. In such case, the following definition can be introduced.

    Definition 2. A dynamic discount function is said to be separable if

    F(x,d,t)=xF(1,d,t):=F(d,t), (1)

    or, more generally,

    F(x,d,t)=u(x)F(d,t), (2)

    with the same conditions as Definition 1, except for the first one.

    Moreover, this discounting model can be simplified by using a function F(t) independent of the delay d. More specifically,

    Definition 3. A stationary discount function F(t) is a real-valued continuous function

    F:TX

    such that

    tF(t),

    where F(t) represents the value at time 0 of a $1 reward available at instant t (usually, t is called the interval), satisfying the following conditions:

    1. F(0)=1, and

    2. F(t) is strictly decreasing.

    Table 1 summarizes the different types of discount functions.

    Table 1.  Different types of discount functions.
    Stationary Dynamic
    Separable u(x)F(t) u(x)F(d,t)
    Non-separable F(x,t) F(x,d,t)

     | Show Table
    DownLoad: CSV

    Definition 4. Let F(x,d,t) be a dynamic discount function. For a given d, the discount operator associated to d is the function

    fd:X×T2X,

    defined as:

    fd(x,s,t):=[F1(,d,s)F(,d,s+t)](x). (3)

    fd(x,s,t) represents the value at d+s of a $x reward available at instant d+s+t. fd is well defined because F(,d,s) is strictly increasing and then injective.

    Remark 2. Obviously, fd is subject to the same restriction as F regarding the valid triples (x,s,t) to be used in Definition 4. More specifically, the domain of fd, denoted by dom(fd), is the following subset of X×T2

    {(x,d,t):(x,d,s+t)dom(F) and F(x,d,s+t)im(F(,d,s)},

    where im denotes the image of a function.

    Figure 2 represents the four previous definitions.

    Figure 2.  Plotting definitions from 1 to 4. Source: Own elaboration.

    Before presenting the next result, we need the following definition.

    Definition 5. Given an additive semigroup (S,+) and a set X, a semigroup action is a map

    :S×XX

    which satisfies the following condition:

    (s1+s2)x=s1(s2x). (4)

    Remark 3. If is a partial map, the action is also labelled as partial.

    Proposition 1. Assume dom(F)=M. For every dD, denote theinterval [d,+[ as Dd. The discount operatorf1d defines an action d of the semigroup (T,+) on the set (X,Dd) in the following way:

    d:T×(X,Dd)(X,Dd),

    defined as:

    td(x,d+s):=(f1d(,s,t)(x),d+s+t). (5)

    f1d is called the counter-discount operator.

    Proof. In effect,

    t1d[t2d(x,d+s)]=t1d(f1d(,s,t2)(x),d+s+t2)=(f1d(,s+t2,t1)[f1d(,s,t2)(x)],d+s+t1+t2).

    Observe that:

    f1d(,s+t2,t1)[f1d(,s,t2)(x)]=F1(,d,s+t1+t2)F(,d,s+t2)F1(,d,s+t2)F(,d,s)(x).

    Therefore,

    t1d[t2d(x,s)]=(f1d(,s,t1+t2)(x),d+s+t1+t2)=(t1+t2)d(x,d+s).

    This completes the proof.

    Remark 4. We can stress the following two remarks:

    1. If dom(F)M, then the action defined in Proposition 1 is partial.

    2. A new action d could be defined instead of d:

    (x,s)dt:=(fd(,st,s)(x),st),

    with the restriction st<0. Consequently, this action could be doubly partial.

    Let F(x,d,t) be a dynamic discount function. Given a specific value of d, the following binary relation, denoted by d, can be defined on X×T.

    Actually, it is defined on the set {(x,t)X×T:(x,d,t)dom(F)}. However, for the sake of simplicity, we will define the binary relation on X×T.

    Definition 6. For every (x,s) and (y,t), with x<y and s<t, we will say that

    (x,s)d(y,t)

    if

    F(x,d,s)=F(y,d,t). (6)

    Observe that, in this case,

    x=fd(y,s,t).

    or, equivalently,

    y=f1d(,s,t)(x).

    Obviously, d is an equivalence relation on X×T§. Thus, given an outcome (x,s), its class of equivalence will be the set

    §This relation could be also defined on X×(d+T).

    [(x,s)]d={(fd(x,r,sr),r):0rs}{(f1d(,s,rs)(x),r):r>s}.

    Observe that each class of equivalence is an indifference line when considering the amount and the interval time (with respect to d) as two economic goods. Additionally, we can define relations of preference between two couples (x,s) and (y,t).

    Example 2. If F(d,t)=11+kdt (d>0, t0 and k=0.05), Figure 3(a) shows the equivalence classes of the outcome (2,7) for d=1 (in blue), d=2 (in green) and d=3 (in red).

    Figure 3.  Plotting several equivalence classes. Source: Own elaboration.

    Example 3. If F(x,t)=(x+1)exp{kd}1, t0 and k=0.1), Figure 3(b) shows the equivalence class of the outcome (2,7) (independent of d).

    On the other hand, we are going to define the following binary relation on X×D, denoted by .

    Definition 7. For every (x,c) and (y,d), x<y and c<d, we will say that

    (x,c)(y,d)

    if

    x=F(y,c,dc). (7)

    In general, is not an equivalence relation because it is reflexive and symmetric but not necessarily transitive. Thus, given an outcome (x,c), the set of its related outcomes is:

    [(x,c)]={(F(x,d,cd),d):dc}{(F1(,c,dc)(x),d):d>c}.

    Example 4. If F(d,t)=11+kdt (d>0, t0 and k=0.05), Figure 3(c) shows the set of outcomes related with (2,7).

    Definition 8. A discount function F is said to be additive if, for every xX, dD, and s and tT, one has:

    F(,d,s)F(,d+s,t)=F(,d,t+s) (8)

    or, equivalently,

    F1(,d+s,t)F1(,d,s)=F1(,d,t+s). (9)

    The next two propositions present two algebraic characterizations of additivity of discount functions by using equivalence relations (Proposition 2) and semigroup actions (Proposition 3). These two new characterizations allow us to use these two algebraic concepts in the study of additive discount functions.

    As formerly indicated, in general the binary relation () associated to a given discount function (see Definition 7) is not an equivalence relation. However, the inclusion in of all the binary relations (d) associated to each benchmark of a given discount function (see Definition 6) is a necessary and sufficient condition to guarantee that F is additive. Therefore, we can enunciate the following statement.

    Take into account that all considered relations are subsets of the Cartesian product X×D.

    Proposition 2. The discount function F is additive if, and only if, for everydD, d (defined on X×(d+T)) is included in.

    Proof. Necessity. Let us consider that F is additive. Assume that (x,d+s)d(y,d+t), with x<y (which implies s<t). By definition of d, F(x,d,s)=F(y,d,t). As F is additive, we can write the former equality as F(,d,s)(x)=[F(,d,s)F(,d+s,ts)](y). By simplifying F(,d,s) on the left, one has x=F(y,d+s,ts) and so (x,d+s)(y,d+t). Consequently, d is included in .

    Sufficiency. Assume that for every dD, d is included in and consider the outcome

    ([F1(,d,s)F(,d,t+s)](x),d+s).

    Obviously,

    ([F1(,d,s)F(,d,t+s)](x),d+s)d(x,d+t+s)

    and so

    [F1(,d,s)(F(,d,t+s)](x)=F(x,d+s,t).

    Consequently,

    [F(,d,s)F(x,d+s,t)](x)=F(x,d,t+s)

    and so F is additive.

    Given a dynamic discount function, we can define the following map:

    :T×(X×D)X×D,

    defined as:

    s(x,d)=(F1(,d,s)(x),d+s). (10)

    Remark 5. Observe that this definition is a particular case of Proposition 1 since:

    s(x,d)=(f1d(x,0,s),d+s)=(F1(,d,s)(x),d+s).

    Intuitively, a discount function can be think as times (whose algebraic structure is semigroup) acting on dated rewards. So, it is reasonable to characterize additivity as an algebraic action of the semigroup of times on the set of dated rewards. Consequently, we can enunciate the following proposition.

    Proposition 3. A discount function F is additive if, and only if, is a semigroup action.

    Proof. In effect, given s1,s2S, on the one hand, one has:

    s2(s1(x,d))=s1(F1(,d,s1)(x),d+s1)=(F1(,d+s1,s2)(F1(,d,s1)(x)),d+s1+s2).

    On the other hand,

    (s1+s2)(x,d)=(F1(,d,s1+s2)(x),d+s1,s2).

    Observe that

    F1(,d+s1,s2)F1(,d,s1)=F1(,d,s1+s2)

    if, and only if, F is additive.

    Remark 6. Let us recall that a partial action of a group G, with identity element 1, on a set X is a collection αg (gG) of partial bijections of X, such that α1 is the identity bijection of X and, for every g,hG, the composition of the partial maps αgαh is the restriction of αgh to the domain of αgαh.

    Here the domain of αgαh is the largest subset of X for which αgαh is applicable. On the other hand, a partial bijection of X is a bijection between two (non necessarily proper) subsets of X. In particular, if g=1, the domain of αg is allowed to be the empty set. This notion allows us to study discount functions in a more general way. But this idea will be considered for a future paper.

    Definition 9. A homomorphism between two S-actions is given by a map h0:X×DX×D and a semigroup morphism h1:SS satisfying:

    h0(sF(x,d))=h1(s)Gh0(x,d). (11)

    Let F be a discount function. For every aD and bD, ab, we define:

    ha,b:X×DX×D

    such as

    ha,b(x,d)=(F1(,b,d)F(,b,ab)F(,a,d)(x),d).

    Theorem 1. ha,b is a homomorphism between the actionsa and b, that is to say, the following diagram is commutative:

    Proof. To do this, we have to show the following equality:

    ha,b(sa(x,d))=sbha,b(x,d),

    that is to say, that the following diagram is commutative:

    In effect, let us calculate the left-hand side of the former equality:

    ha,b(sa(x,d))=ha,b(f1a(,d,s)(x),d+s)=ha,b(F1(,a,d+s)F(,a,d)(x),d+s)=(F1(,b,d+s)F(,b,ab)F(,a,d+s)F1(,a,d+s)F(,a,d)(x),d+s)=(F1(,b,d+s)F(,b,ab)F(,a,d)(x),d+s).

    On the other hand, the right-hand side can be displayed as follows:

    sbha,b(x,d)=sb(F1(,b,d)F(,b,ab)F(,a,d)(x),d)=(f1b(,d,s)F1(,b,d)F(,b,ab)F(,a,d)(x),d+s)=(F1(,b,d+s)F(,b,d)F1(,b,d)F(,b,ab)F(,a,d)(x),d+s)=(F1(,b,d+s)F(,b,ab)F(,a,d)(x),d+s).

    Observe that the two results coincide. Then, the theorem holds.

    Remark 7. The following remarks have to be taken into account:

    1. If a<b, we define

    ha,b(x,d)=(F1(,a,d)F(,a,ba)F(,b,d)(x),d). (12)

    2. Observe that, in the general definition of a homomorphism between actions, h1(s)=s.

    Theorem 2. If a>b and F is additive, then ha,b(x,d)=F(x,b+d,ab).

    Proof. In effect, if F is additive, one has:

    F(,b,d)F(,b+d,ab)=F(,b,ab)F(,a,d),

    from where:

    ha,b(x,d)=F1(,b,d)F(,b,ab)F(,a,d)(x)=F(,b+d,ab).

    Remark 8. In general, the converse implication does not hold. In effect, if ha,b(x,d)=F(x,b+d,ab), one has:

    F(,b,d)F(,b+d,ab)=F(,b,ab)F(,a,d),

    which could be written as:

    F[F(x,b+d,ab),b,d]=F[F(x,a,d),b,ab].

    Let us consider the real-valued function

    F(x,t)=ln{(ex1)f(t)+1},

    where f is a unitary, stationary discount function. Under these conditions, F is a stationary discount function:

    F(0,t)=0, for every tdom(f).

    F(x,0)=x, for every xR+.

    F(x,t)x=1(ex1)f(t)+1exf(d)>0.

    F(x,t)t=1(ex1)f(t)+1(ex1)f(d)<0.

    In general, one has:

    F[F(x,t1),t2]=F[ln{(ex1)f(t1)+1},t2]=ln{(ex1)f(t1)f(t2)+1}.

    On the other hand,

    F(x,t1+t2)=ln{(ex1)f(t1+t2)+1}.

    Therefore, F is additive if, and only if, f is additive. However, observe that

    F[F(x,t1),t2]=F[F(x,t2),t1].

    Thus, making t1=ab and t2=d, the counterexample follows.

    However, if moreover F(x,t) is separable, that is to say, F(x,t)=u(x)F(t), a characterization can be provided in the following way.

    Corollary 1. Let F(x,t)=u(x)F(t) be a separable discount function such that limx+u(x)=+. In theseconditions, u(x)=kx (k>0) if, and only if,

    F[F(x,t1),t2]=F[F(x,t2),t1]. (13)

    Proof. In effect, if u(x)=kx (k>0) then the conclusion is obvious. Reciprocally, if F[F(x,t1),t2]=F[F(x,t2),t1], one has:

    u[u(x)F(t1)]F(t2)=u[u(x)F(t2)]F(t1).

    In particular, if t1=t and t2=t+h, then:

    F(t+h)F(t)=u[u(x)F(t+h)]u[u(x)F(t)].

    Taking natural logarithms in both sides of the former equality, dividing by h and letting h0, one has:

    ddt[lnF(t)]=ddt[lnu[u(x)F(t)]]

    or, equivalently,

    F(t)F(t)=u[u(x)F(t)]u(x)F(t)u[u(x)F(t)].

    By simplifying F(t) and rearranging terms,

    u[u(x)F(t)]u(x)F(t)u[u(x)F(t)]=1.

    Making the change of variable u(x)F(t)=z, one has:

    zu(z)u(z)=1,

    which is a differential equation:

    u(z)u(z)=1z,

    whose solution is:

    u(z)=kz,

    where k>0. This completes the proof.

    Let F be a dynamic discount function. For every date dD, we can consider the function

    Fd:X×TX,

    such that

    (x,t)Fd(x,t),

    defined by:

    Fd(x,t):=F(x,d,t). (14)

    This "truncated" discount function will be called the discount function (referenced) at time d. Given two dated rewards (x,s) and (y,t), where s<t, we will say that the vector

    v:=((y,t),(x,s))

    does exist if (x,s)d(y,t), that is to say, x=fd(,s,ts)(y). In such a case, the vector

    v:=((x,s),(y,t))

    also exists because, by the symmetric property, (y,t)d(x,s), that is to say, y=f1d(,s,ts)(x) (see Figure 4).

    Figure 4.  Vectors over indifference lines. Source: Own elaboration.

    Remark 9. In the particular case in which Fd is separable, i.e., Fd(x,t)=u(x)Fd(t), the vector v:=((y,t),(x,s)) does exist if

    u(x)=u(y)Fd(t)Fd(s). (15)

    Moreover, as u(y)=u(x)Fd(s)Fd(t), then the vector v:=((x,s),(y,t)) also exists.

    The set of all so-defined vectors will be denoted by Vd.

    Let F be a set of dynamic discount functions. Consider the set X×D, where X=R+ is the set of amounts and D=R is the set of calendar times.

    Definition 10. A quiver on F is a quadruple QF=(Q0,Q1,s,t), where:

    Q0:=X×D is the set of vertices.

    Q1 is the set of arrows. Specifically, there will be an arrow a between two vertices v1=(x,d) and v2=(x,d), represented by v1av2, if there is a dynamic discount function, FF, such that F(x,d,dd)=x.

    Obviously, between two given vertices there can be several arrows.

    s,t:Q1Q0 are two functions, called the source and the target, respectively, such that s(a)=v1 and t(a)=v2.

    Definition 11. A path of length n between two vertices v and w is a sequence (v,a1,a2,,an,w), where a1,a2,,an are arrows, s(a1)=v and t(ai)=s(ai+1), for every 1in1, and t(an)=w. Schematically,

    v:=v0a1v1a2v2a3anvn:=w.

    The set of all paths of length n will be denoted by Qn. To the just-defined quiver QF we can associate a path, denoted by RQF and defined as follows. Consider the R-vector space whose basis is the set of all paths of length n, for every nN, and whose product is defined by the concatenation of paths, i.e., given two basis vectors (v,a1,,an,w) and (v,a1,,am,w) of RQF, its product is:

    (v,a1,,an,a1,,am,w),

    if w=v, and the empty path, if wv.

    One has the following R-vector space direct sum decomposition:

    RQF=RQ0RQ1RQ2RQk,

    where RQk is the subspace of RQF generated by all paths of length k. Clearly, RQkRQlRQk+l, for every k,lN. Thus, RQF is a N-graded algebra.

    1. If F={F}, being F a dynamic discount function, then QF is called the quiver associated to F.

    2. F composed by all dynamic discount functions.

    We will say that two paths in the quiver algebra are equivalent if they have the same starting vertex and the same ending vertex.

    Proposition 4. A dynamic discount function is additive if, and only if, everypath in the quiver algebra is equivalent to a path of length one.

    When the set D is discrete, we can obtain other characterizations of additive discount functions by using the representation of quivers. In effect, take as vertices the set D of calendar times. Indeed, we can think that this set is discrete, then obtaining a quiver of the following form:

    012n.

    This quiver is denoted as A. Moreover, it is possible to consider the quiver A, i.e., the quiver of the form:

    n1012n.

    Each vertex corresponds to a calendar time, say ti, for the vertex i. Recall that a R-representation of a quiver consists in associating to each vertex vQ an R-vector space Vv and, for each arrow a:vw, a R-linear map fa:VvVw. We denote this representation by ({Vv}vQ0,{fa}aQ1).

    Given a discount function F, we can construct a representation in the quiver A (or A). In effect, we can associate R (the set of amounts) to any vertex vA and, to any arrow a:nn+1, the R-linear map defined as:

    F(,tn,tn+1tn):RR.

    For a nontrivial path p=a1a2ak from v to w:

    a=v0a1v2akvk=w,

    we can define a map from Vv=R to Vw=R, called the evaluation, by:

    fp=fakfak1fa2fa1. (16)

    This evaluation can be extended to linear combinations of paths with the same origin and target:

    q=ni=1rici

    from which:

    fq=ni=1rifci.

    Proposition 5. A discount function is additive if, and only if, for every path in the quiver algebra p, the evaluation fp coincides with F(,tv,twtv).

    Given two discount functions F1 and F2, we can define a homomorphism between the representations that they define. A homomorphism between these two representations is given by a set of R-linear maps:

    {αv}vQ0,

    which are compatible with the maps associated to the arrows in the representations, i.e., for an arrow a:vw then

    (f2)vαv=αw(f1)w.

    Given two vectors v=((x,s),(y,t)) and v=((x,s),(y,t)) (observe that nothing is said about the relationship between s and t, and between s and t), we will say that

    vdv (17)

    if

    xy=xy, (18)

    that is to say,

    fd(,s,ts)(y)y=fd(,s,ts)(y)y. (19)

    Remark 10. In the particular case in which Fd is separable, one has:

    ((x,s),(y,t))d((x,s),(y,t))

    if

    fd(s,ts)=fd(s,ts). (20)

    Obviously, d is an equivalence relation. The quotient set Vd/d will be denoted by Vd. In the next subsection, we are going to define a "sum" and a "scalar product" on Vd. But before, we need the following definition.

    Definition 12. A discount function referenced at time d is said to be regular if

    limtFd(t)=0. (21)

    In what follows, we are going to assume that Fd is regular.

    For the sake of clarity in the presentation, we are going to start with the separable case. Let v=[(x,s),(y,t)], s<t, and v=[(x,s),(y,t)], s<t, two vectors in Vd. In this case, one has:

    u(x)u(y)=fd(s,ts)

    and

    u(x)u(y)=fd(s,ts).

    Let us see if it is possible to find a representative w:=((y,t),(z,u)), t<u, of v. In this case,

    fd(t,ut)=fd(s,ts).

    This equation is equivalent to require:

    Fd(u)Fd(t)=Fd(t)Fd(s),

    from where:

    Fd(u)=Fd(t)Fd(s)Fd(t)<Fd(t).

    As Fd is regular, the existence of u is guaranteed. Therefore, we define:

    v+v:=[(x,s),(z,u)], (22)

    which, obviously, is well defined (see Figure 5(a)).

    Figure 5.  Sum of vectors in Vd. Source: Own elaboration.

    Let us see now the general case. Let v=[(x,s),(y,t)], s<t, and v=[(x,s),(y,t)], s<t, two vectors in Vd. In this case, one has:

    y=f1d(,s,ts)(x)

    and

    y=f1d(,s,ts)(x).

    The values of z and u can be obtained from the following system of equations:

    Fd(z,u)=Fd(y,t)

    or

    Fd(z,u)=Fd(x,s).

    As before, we define:

    v+v:=[(x,s),(z,u)]. (23)

    Other cases are briefly described in the following items:

    v=[(y,t),(x,s)], s<t, and v=[(y,t),(x,s)], s<t, in whose case w:=((z,u),(y,t)), t<u, and v+v:=[(z,u),(x,s)] (see Figure 5(b)).

    v=[(x,s),(y,t)], s<t, and v=[(y,t),(x,s)], s<t, in whose case w:=((z,u),(x,s)), s<u, and v+v:=[(z,u),(y,t)] (see Figure 5(c)).

    v=[(y,t),(x,s)], s<t, and v=[(x,s),(y,t)], s<t, in whose case w:=((x,s),(z,u)), s<u, and v+v:=[(y,t),(z,u)] (see Figure 5(d)).

    For the sake of clarity in the presentation, we are going to start with the separable case. Let v=[(x,s),(y,t)], s<t, a vector in Vd and α a real number. In this case, one has:

    u(x)u(y)=fd(s,ts).

    We will consider two cases:

    1. α0. In this case,

    αv=[(x,s),(z,u)],s<u, (24)

    such that

    u(x)u(z)=[u(x)u(y)]α

    or, equivalently,

    fd(s,us)=[fd(s,ts)]α.

    From the last equation, one has:

    Fd(u)=[Fd(t)]α[Fd(s)]α1<1.

    As Fd is regular, the existence of u is guaranteed.

    2. α<0. In this case,

    αv=[(z,u),(x,s)],s<u, (25)

    such that

    zx=(xy)α

    or, equivalently,

    f1d(s,us)=[fd(s,ts)]α.

    From the last equation, one has:

    Fd(u)=[Fd(t)]α[Fd(s)]α+1<1.

    As Fd is regular, the existence of u is again guaranteed (see Figure 6).

    Figure 6.  Scalar product in Vd. Source: Own elaboration.

    Let us see now the general case. Let v=[(x,s),(y,t)], s<t, a vector in Vd and α a real number. In this case, one has:

    x=fd(,s,ts)(y).

    We will consider two cases:

    1. α0 (see Figure 6(a)). In this case,

    αv=[(x,s),(z,u)],s<u, (26)

    such that

    xz=(xy)α

    and

    Fd(z,u)=Fd(x,s).

    From the former system of equations, we can obtain the values of z and u.

    2. α<0 (see Figure 6(b)). In this case,

    αv=[(z,u),(x,s)],s<u, (27)

    such that

    zx=(xy)α

    and

    Fd(z,u)=Fd(x,s).

    From the former system of equations, we can obtain the values of z and u.

    It is straightforward to show that (Vd,+,) is a vector space of dimension 1.

    Remark 11. Observe that the former construction could analogously be made on a given indifference line. Specifically, the indifference line crossing the point (x,0)X×D, denoted by Ed,x, gives rise to a vector subspace of (Vd,+,). Moreover, is is straightforward to see that all these subspaces are isomorphic. Finally, each indifference line is an affine space whose reference system is Rd,x=((x,0),{((F1(,d,t)(x),0),(x,t))}).

    Each vector in Vd is characterized by its norm, defined as::

    ● If v=[(y,t),(x,s)], s<t, then:

    v:=lnfd(,s,ts).

    ● If v=[(x,s),(y,t)], s<t, then:

    v:=lnf1d(,s,ts).

    Obviously, satisfies the properties of a norm in a vector space.

    Let d be a given date in D and let us denote the interval [d,+[ as Dd. Consider the set Ed:=X×Dd. We will say that there exists a vector v from (x,d+s) to (y,d+s+t)Ed:

    v=((x,d+s),(y,d+s+t)),

    where x, y, s and tR+, if fd(x,s,t)=y, that is to say,

    [F1(,d,s+t)F(,d,s)](x)=y. (28)

    The elements of this vector space, denoted by Vd, are the finite concatenations of R-multiples of the just defined vectors.

    Proposition 6. Ed is a partial affine space associated to the vector spaceVd.

    Proof. In effect, the function φ(x,s):EdVd, such that φ(x,s)(y,t):=((x,s),(y,t) is injective (partially bijective). Moreover, the concatenation of vectors ((x,s),(y,t)) and ((y,t),(z,u)) is the vector ((x,s),(z,u)). In effect, the existence of vector ((x,s),(y,t)) is guaranteed because:

    [F1(,d,t)F(,d,s)](x)=y.

    Analogously, vector ((y,t),(z,u)) exists because:

    [F1(,d,u)F(,d,t)](y)=z.

    By replacing y of the first equation into the second equation and simplifying, one has:

    [F1(,d,u)F(,d,s)](x)=z,

    which defines the vector ((x,s),(z,u)). Consequently, Chasles' equality holds and Ed is a partial affine space.

    Proposition 7. Rd=(d,{((F(x,d,t),0),(x,t))}) is a reference system ofthe partial affine space Ed.

    Corollary 2. The change of the affine reference Rd to the reference Rd(d<d) is given by the function F(,d,d).

    Remark 12. A similar alternative approach is the following. Let P be an ordered set. An increasing subset (or order filter) of P is a subset UP such that xU and yx imply yU. The increasing subsets of P can be easily seen as the open sets of a topology on P. Thus, every point xP is included in a unique smallest open set

    Vx={yP:yx},

    called the principal filter of x.

    A sheaf F of discount functions over P associates to every element xP, Fx, the set of all discount functions defined on Vx and, if xy, there is a function fxy:FxFy. Moreover, if xyz, then fxz=fyzfxy.

    This approach will be examined in detail in further research.

    This paper has provided a wide range of algebraic concepts and structures able to fit the logic and rationality behind the behavior of financial decision makers. This research is justified by the dynamism which characterizes the working of financial markets and institutions. The main contribution of this manuscript is the involvement of abstract algebra to lay the foundations of financial mathematics, role which traditionally has been leaded by other disciplines such as statistics, probability, calculus and topology.

    On the other hand, this paper has analyzed, from different points of view, the concept of additivity of discount functions which guarantees the transitivity in the choice of dated rewards. Indeed, this is a central topic in financial mathematics as it points out the limits of rationality of decision makers in intertemporal choices. In this way, another contribution of this paper is the characterization of financial processes, in particular the so-defined discount operators, as affine spaces and quivers by analyzing the property of additivity in these algebraic contexts.

    Crossed product is a very important construction in the theory of actions of semigroups on sets. Unfortunately, in the problem studied in this paper, it has not been possible to construct such object.

    We are very grateful for the comments and suggestions offered by two anonymous referees. The first author has been partially supported by the Mediterranean Research Center of Economy and Sustainable Development (CIMEDES), University of Almería (Spain). The second author has been partially supported by grants FEDER-UAL18-FQM-B042-A and PY20_00770 from Junta de Andalucía.

    All authors declare no conflicts of interest in this paper.



    [1] A. Ahmed, M. R. H. Alzgool, Z. Abro, U. Ahmed, U. Memon, Understanding the nexus of intellectual, social and psychological capital towards business innovation through critical insights from organizational culture, Humanit. Soc. Sci. Rev., 7 (2019), 1082–1086. https://doi.org/10.18510/hssr.2019.75144 doi: 10.18510/hssr.2019.75144
    [2] O. Y. M. Al-Rawi, T. Mukherjee, Application of linear programming in optimizing labour scheduling, J. Math. Financ., 9 (2019), 272–285. https://doi.org/10.4236/jmf.2019.93016 doi: 10.4236/jmf.2019.93016
    [3] B. Oryani, A. Moridian, B. Sarkar, S. Rezania, H. Kamyab, M. K. Khan, Assessing the financial rеsоurсе curse hypothesis in Iran: Thе nоvеl dynаmiс АRDL approach, Resour. Policy, 78 (2022), p. 102899. https://doi.org/10.1016/j.resourpol.2022.102899
    [4] F. H. Staudt, G. Alpan, M. Di Mascolo, C. M. T. Rodriguez, Warehouse performance measurement: a literature review, Int. J. Prod. Res., 53 (2015), 5524–5544. https://doi.org/10.1080/00207543.2015.1030466 doi: 10.1080/00207543.2015.1030466
    [5] B. Sarkar, B. K. Dey, M. Sarkar, S. J. Kim, A smart production system with an autonomation technology and dual channel retailing, Comput. Ind. Eng., 173 (2022), 108607. https://doi.org/10.1016/j.cie.2022.108607 doi: 10.1016/j.cie.2022.108607
    [6] M. Kaviyani, S. Ghodsypour, M. Hajiaghaei-Keshteli, Impact of Adopting Quick Response and Agility on Supply Chain Competition with Strategic Customer Behavior, Sci. Iran., (2020). https://doi.org/10.24200/sci.2020.53691.3366 doi: 10.24200/sci.2020.53691.3366
    [7] A. Sarkar, R. Guchhait, B. Sarkar, Application of the artificial neural network with multithreading within an inventory model under uncertainty and inflation, Int. J. Fuzzy Syst., 24 (2022), 2318–2332. https://doi.org/10.1007/s40815-022-01276-1 doi: 10.1007/s40815-022-01276-1
    [8] S. V. S. Padiyar, Vandana, N. Bhagat, S. R. Singh, B. Sarkar, Joint replenishment strategy for deteriorating multi-item through multi-echelon supply chain model with imperfect production under imprecise and inflationary environment, RAIRO-Oper. Res., 56 (2022), 3071–3096. https://doi.org/10.1051/ro/2022071 doi: 10.1051/ro/2022071
    [9] A. Mondal, S. Pareek, K. Chaudhuri, A. Bera, R. K. Bachar, B. Sarkar, Technology license sharing strategy for remanufacturing industries under a closer-loop supply chain management bonding, RAIRO-Oper. Res., 56 (2022), 3017–3045. https://doi.org/10.1051/ro/2022058 doi: 10.1051/ro/2022058
    [10] B. Sarkar, S. Kar, K. Basu, R. Guchhait, A sustainable managerial decision-making problem for a substitutable product in a dual-channel under carbon tax policy, Comput. Ind. Eng., 172 (2022), 108635. https://doi.org/10.1016/j.cie.2022.108635 doi: 10.1016/j.cie.2022.108635
    [11] S. Hota, S. Ghosh, B. Sarkar, Involvement of smart technologies in an advanced supply chain management to solve unreliability under distribution robust approach, AIMS Environ. Sci., 9 (2022), 461–492. https://doi.org/10.3934/environsci.2022028 doi: 10.3934/environsci.2022028
    [12] B. Sarkar, D. Takeyeva, R. Guchhait, M. Sarkar, Optimized radio-frequency identification system for different warehouse shapes, Knowledge-Based Syst., 258 (2022), 109811. https://doi.org/10.1016/j.knosys.2022.109811 doi: 10.1016/j.knosys.2022.109811
    [13] R. K. Bachar, S. Bhuniya, S. K. Ghosh, B. Sarkar, Sustainable green production model considering variable demand, partial outsourcing, and rework, AIMS Environ. Sci., 9 (2022), 325–353. https://doi.org/10.3934/environsci.2022022 doi: 10.3934/environsci.2022022
    [14] B. Shaw, I. Sangal, B. Sarkar, Reduction of greenhouse gas emissions in an imperfect production process under breakdown consideration, AIMS Environ. Sci., 9 (2022), 658–691. https://doi.org/10.3934/environsci.2022038 doi: 10.3934/environsci.2022038
    [15] S. Kumar, M. Sigroha, K. Kumar, B. Sarkar, Manufacturing/remanufacturing based supply chain management under advertisements and carbon emissions process, RAIRO-Oper. Res., 56 (2022), 831–851.[Online]. Available: https://doi.org/10.1051/ro/2021189 doi: 10.1051/ro/2021189
    [16] S. Hota, S. Ghosh, B. Sarkar, A solution to the transportation hazard problem in a supply chain with an unreliable manufacturer, AIMS Environ. Sci., 9 (2022), 354–380. https://doi.org/10.3934/environsci.2022023 doi: 10.3934/environsci.2022023
    [17] G. Maity, V. F. Yu, S. K. Roy, Optimum Intervention in Transportation Networks Using Multimodal System under Fuzzy Stochastic Environment, J. Adv. Transp., 2022 (2022), 3997396. https://doi.org/10.1155/2022/3997396 doi: 10.1155/2022/3997396
    [18] B. Sarkar, B. Ganguly, S. Pareek, L. E. Cárdenas-Barrón, A three-echelon green supply chain management for biodegradable products with three transportation modes, Comput. Ind. Eng., 174 (2022), 108727. https://doi.org/10.1016/j.cie.2022.108727 doi: 10.1016/j.cie.2022.108727
    [19] M. Mishra, S. K. Ghosh, B. Sarkar, Maintaining energy efficiencies and reducing carbon emissions under a sustainable supply chain management, AIMS Environ. Sci., 9 (2022), 603–635. https://doi.org/10.3934/environsci.2022036 doi: 10.3934/environsci.2022036
    [20] A.-L. Ladier, G. Alpan, Cross-docking operations: Current research versus industry practice, Omega, 62 (2016), 145–162. https://doi.org/10.1016/j.omega.2015.09.006 doi: 10.1016/j.omega.2015.09.006
    [21] S. C. Corp, Cross-docking Trend Report, Whitepaper Series, Saddle Creek Corp: Lakeland, FL, USA, 2011. Available: http://www.distributiongroup.com/articles/070111DCMwe.pdf
    [22] F. Essghaier, H. Allaoui, G. Goncalves, Truck to door assignment in a shared cross-dock under uncertainty, Expert Syst. Appl., 182 (2021), 114889. https://doi.org/10.1016/j.eswa.2021.114889 doi: 10.1016/j.eswa.2021.114889
    [23] P. Bodnar, K. Azadeh, R. De Koster, Scheduling trucks in a cross-dock with mixed service mode dock doors, Transp. Sci., 51 (2015). https://doi.org/10.1287/trsc.2015.0612 doi: 10.1287/trsc.2015.0612
    [24] J. Van Belle, P. Valckenaers, D. Cattrysse, Cross-docking: State of the art, Omega, 40 (2012), 827–846. https://doi.org/10.1016/j.omega.2012.01.005 doi: 10.1016/j.omega.2012.01.005
    [25] S. Ambroszkiewicz, S. Bylka, Relatively optimal policies for stock management in a supply chain with option for inventory space limitation, Appl. Math. model., 114 (2023), 291–317. https://doi.org/10.1016/j.apm.2022.09.033 doi: 10.1016/j.apm.2022.09.033
    [26] A. (Arsalan) Ardakani, J. Fei, A systematic literature review on uncertainties in cross-docking operations, Mod. Supply Chain Res. Appl., 2 (2020), 2–22. https://doi.org/10.1108/MSCRA-04-2019-0011 doi: 10.1108/MSCRA-04-2019-0011
    [27] M. F. Monaco, M. Sammarra, Managing loading and discharging operations at cross-docking terminals, Procedia Manuf., 42 (2020), 475–482.https://doi.org/10.1016/j.promfg.2020.02.045 doi: 10.1016/j.promfg.2020.02.045
    [28] K. Stephan, N. Boysen, Cross-docking, J. Manag. Control, 22 (2011), 129. https://doi.org/10.1007/s00187-011-0124-9 doi: 10.1007/s00187-011-0124-9
    [29] P. Buijs, I. F. A. Vis, H. J. Carlo, Synchronization in cross-docking networks: A research classification and framework, Eur. J. Oper. Res., 239 (2014), 593–608. https://doi.org/10.1016/j.ejor.2014.03.012 doi: 10.1016/j.ejor.2014.03.012
    [30] W. Wisittipanich, T. Irohara, P. Hengmeechai, Truck scheduling problems in the cross docking network, Int. J. Logist. Syst. Manag., 33 (2019), 420. https://doi.org/10.1504/IJLSM.2019.101164 doi: 10.1504/IJLSM.2019.101164
    [31] P. B. Castellucci, A. M. Costa, F. Toledo, Network scheduling problem with cross-docking and loading constraints, Comput. Oper. Res., 132 (2021), 105271. https://doi.org/10.1016/j.cor.2021.105271 doi: 10.1016/j.cor.2021.105271
    [32] G. Tadumadze, N. Boysen, S. Emde, F. Weidinger, Integrated truck and workforce scheduling to accelerate the unloading of trucks, Eur. J. Oper. Res., 278 (2019), 343–362. https://doi.org/10.1016/j.ejor.2019.04.024 doi: 10.1016/j.ejor.2019.04.024
    [33] A. M. Fathollahi-Fard, M. Ranjbar-Bourani, N. Cheikhrouhou, M. Hajiaghaei-Keshteli, Novel modifications of social engineering optimizer to solve a truck scheduling problem in a cross-docking system, Comput. Ind. Eng., 137 (2019), 106103. https://doi.org/10.1016/j.cie.2019.106103 doi: 10.1016/j.cie.2019.106103
    [34] A. Golshahi-Roudbaneh, M. Hajiaghaei-Keshteli, M. M. Paydar, Developing a lower bound and strong heuristics for a truck scheduling problem in a cross-docking center, Knowledge-Based Syst., 129 (2017), 17–38. https://doi.org/10.1016/j.knosys.2017.05.006 doi: 10.1016/j.knosys.2017.05.006
    [35] M. A. Dulebenets, A diploid evolutionary algorithm for sustainable truck scheduling at a cross-docking facility, Sustain., 10 (2018), 1333.https://doi.org/10.3390/su10051333 doi: 10.3390/su10051333
    [36] M. A. Dulebenets, A comprehensive evaluation of weak and strong mutation mechanisms in evolutionary algorithms for truck scheduling at cross-docking terminals, IEEE Access, 6 (2018), 65635–65650. https://doi.org/10.1109/ACCESS.2018.2874439 doi: 10.1109/ACCESS.2018.2874439
    [37] M. A. Dulebenets, An adaptive polyploid memetic algorithm for scheduling trucks at a cross-docking terminal, Inf. Sci. (Ny)., 565 (2021), 390–421. https://doi.org/10.1016/j.ins.2021.02.039 doi: 10.1016/j.ins.2021.02.039
    [38] M. A. Dulebenets, A delayed start parallel evolutionary algorithm for just-in-time truck scheduling at a cross-docking facility, Int. J. Prod. Econ., 212 (2019), 236–258. https://doi.org/10.1016/j.ijpe.2019.02.017 doi: 10.1016/j.ijpe.2019.02.017
    [39] O. Theophilus, M. A. Dulebenets, J. Pasha, O. F. Abioye, M. Kavoosi, Truck scheduling at cross-docking terminals: A follow-up state-of-the-art review, Sustain., 11 (2019), 5245. https://doi.org/10.3390/su11195245 doi: 10.3390/su11195245
    [40] S. Mousavi, B. Vahdani, A robust approach to multiple vehicle location-routing problems with time windows for optimization of cross-docking under uncertainty, J. Intell. Fuzzy Syst., 32 (2017), 49–62. http://dx.doi.org/10.3233/JIFS-151050 doi: 10.3233/JIFS-151050
    [41] X. Zhang, J. Li, Z. Yang, X. Wang, Collaborative optimization for loading operation planning and vessel traffic scheduling in dry bulk ports, Adv. Eng. Informatics, 51 (2022), 101489. https://doi.org/10.1016/j.aei.2021.101489 doi: 10.1016/j.aei.2021.101489
    [42] O. Theophilus, M. A. Dulebenets, J. Pasha, Y. yip Lau, A. M. Fathollahi-Fard, A. Mazaheri, Truck scheduling optimization at a cold-chain cross-docking terminal with product perishability considerations, Comput. Ind. Eng., 156 (2021), 107240. https://doi.org/10.1016/j.cie.2021.107240 doi: 10.1016/j.cie.2021.107240
    [43] A. Golshahi-Roudbaneh, M. Hajiaghaei-Keshteli, M. M. Paydar, Cross-dock scheduling considering time windows and deadline for truck departures, Sci. Iran., 28 (2021), 532–546. https://doi.org/10.24200/sci.2019.52662.2824 doi: 10.24200/sci.2019.52662.2824
    [44] F. Pan, W. Zhou, T. Fan, S. Li, C. Zhang, Deterioration rate variation risk for sustainable cross-docking service operations, Int. J. Prod. Econ., 232 (2021), 107932. https://doi.org/10.1016/j.ijpe.2020.107932 doi: 10.1016/j.ijpe.2020.107932
    [45] F. Zheng, Y. Pang, Y. Xu, M. Liu, Heuristic algorithms for truck scheduling of cross-docking operations in cold-chain logistics, Int. J. Prod. Res., 59 (2021), 6579–6600. https://doi.org/10.1080/00207543.2020.1821118 doi: 10.1080/00207543.2020.1821118
    [46] L. C. Soares, E. Ferneda, H. A. do Prado, Transportation and logistics observatories: Guidelines for a conceptual model, Transp. Res. Interdiscip. Perspect., 16 (2022), 100682. https://doi.org/10.1016/j.trip.2022.100682 doi: 10.1016/j.trip.2022.100682
    [47] M. Forkan, M. M. Rizvi, M. A. M. Chowdhury, Multiobjective reverse logistics model for inventory management with environmental impacts: An application in industry, Intell. Syst. with Appl., 14 (2022), 200078. https://doi.org/10.1016/j.iswa.2022.200078 doi: 10.1016/j.iswa.2022.200078
    [48] Y. Idel Mahjoub, E. houcine Chakir El-Alaoui, A. Nait-Sidi-Moh, Logistic network modeling and optimization: An approach based on (max, +) algebra and coloured Petri nets, Comput. Ind. Eng., 158 (2021), 107341. https://doi.org/10.1016/j.cie.2021.107341 doi: 10.1016/j.cie.2021.107341
    [49] N. Boysen, M. Fliedner, Cross dock scheduling: Classification, literature review and research agenda, Omega, 38 (2010), 413–422. https://doi.org/10.1016/j.omega.2009.10.008 doi: 10.1016/j.omega.2009.10.008
    [50] S. Pan, D. Trentesaux, D. McFarlane, B. Montreuil, E. Ballot, G. Q. Huang, Digital interoperability in logistics and supply chain management: state-of-the-art and research avenues towards physical internet, Comput. Ind., 128 (2021), 103435. https://doi.org/10.1016/j.compind.2021.103435 doi: 10.1016/j.compind.2021.103435
    [51] T. Chargui, A.-L. Ladier, A. Bekrar, S. Pan, D. Trentesaux, Towards designing and operating physical internet cross-docks: Problem specifications and research perspectives, Omega, 111 (2022), 102641. https://doi.org/10.1016/j.omega.2022.102641 doi: 10.1016/j.omega.2022.102641
    [52] T. Mukherjee, I. Sangal, B. Sarkar, T. M. Alkadash, Mathematical estimation for maximum flow of goods within a cross-dock to reduce inventory, 19 (2022), 13710–13731. https://doi.org/10.3934/mbe.2022639
    [53] G. Vieira, G. Pasa, M. Borsa, G. S. Milan, A. Pandolfo, Materials handling management:A case study, J. Oper. Supply Chain Manag., 4 (2011), 19. https://doi.org/10.12660/joscmv4n2p19-30 doi: 10.12660/joscmv4n2p19-30
    [54] S. K. Das, M. Pervin, S. K. Roy, G. W. Weber, Multi-objective solid transportation-location problem with variable carbon emission in inventory management: a hybrid approach, Ann. Oper. Res., (2021), 1–27. https://doi.org/10.1007/s10479-020-03809-z
    [55] M. Cherkesly, T. Gschwind, The pickup and delivery problem with time windows, multiple stacks, and handling operations, Eur. J. Oper. Res., 301(2022), 647–666. https://doi.org/10.1016/j.ejor.2021.11.021 doi: 10.1016/j.ejor.2021.11.021
    [56] M. Bertolini, D. Mezzogori, M. Neroni, F. Zammori, A dynamic operative framework for allocation in automated storage and retrieval systems, Expert Syst. Appl., 213 (2023), 118940. https://doi.org/10.1016/j.eswa.2022.118940 doi: 10.1016/j.eswa.2022.118940
    [57] İ. Küç ükoğlu, The effects of crossdock shapes on material handling costs, Int. J. Comput. Eng. Res., 10 (2016), 2250–3005.
    [58] W. Nassief, I. Contreras, R. As'ad, A mixed-integer programming formulation and Lagrangean relaxation for the cross-dock door assignment problem, Int. J. Prod. Res., 54 (2016), 494–508. https://doi.org/10.1080/00207543.2014.1003664 doi: 10.1080/00207543.2014.1003664
    [59] L. Zhang, Optimization and simulation of a cross-docking terminal, PhD Thesis, Ecole Centrale de Lille, France, 2016.
    [60] C. Serrano, X. Delorme, A. Dolgui, Cross-dock distribution and operation planning for overseas delivery consolidation: A case study in the automotive industry, CIRP J. Manuf. Sci. Technol., 33 (2021), 71–81. https://doi.org/10.1016/j.cirpj.2021.02.007 doi: 10.1016/j.cirpj.2021.02.007
    [61] S. Shahram fard, B. Vahdani, Assignment and scheduling trucks in cross-docking system with energy consumption consideration and trucks queuing, J. Clean. Prod., 213 (2019), 21–41. https://doi.org/10.1016/j.jclepro.2018.12.106 doi: 10.1016/j.jclepro.2018.12.106
    [62] Q. Fabry, A. Agnetis, L. Berghman, C. Briand, Complexity of flow time minimization in a crossdock truck scheduling problem with asymmetric handover relations, Oper. Res. Lett., 50 (2022), 50–56. https://doi.org/10.1016/j.orl.2021.12.004 doi: 10.1016/j.orl.2021.12.004
    [63] W. Yu, P. J. Egbelu, Scheduling of inbound and outbound trucks in cross docking systems with temporary storage, Eur. J. Oper. Res., 184 (2008), 377–396. https://doi.org/10.1016/j.ejor.2006.10.047 doi: 10.1016/j.ejor.2006.10.047
    [64] A. Fumi, L. Scarabotti, M. M. Schiraldi, Minimizing warehouse space with a dedicated storage policy, Int. J. Eng. Bus. Manag., 5 (2013), 21. https://doi.org/10.5772/56756 doi: 10.5772/56756
    [65] A. S. Dijkstra, K. J. Roodbergen, Exact route-length formulas and a storage location assignment heuristic for picker-to-parts warehouses, Transp. Res. Part E Logist. Transp. Rev., 102 (2017), 38–59. https://doi.org/10.1016/j.tre.2017.04.003 doi: 10.1016/j.tre.2017.04.003
    [66] E. Charris, J. Rojas-Reyes, J. Montoya-Torres, The storage location assignment problem: A literature review, Int. J. Ind. Eng. Comput., 10 (2018), 199–224. https://doi.org/10.5267/j.ijiec.2018.8.001 doi: 10.5267/j.ijiec.2018.8.001
    [67] N. Zaerpour, Y. Yu, R. De Koster, Storing fresh produce for fast retrieval in an automated compact cross-dock system, Prod. Oper. Manag., 24 (2014). https://doi.org/10.1111/poms.12321 doi: 10.1111/poms.12321
    [68] A. Silva, K. J. Roodbergen, L. C. Coelho, M. Darvish, Estimating optimal ABC zone sizes in manual warehouses, Int. J. Prod. Econ., 252 (2022), 108579. https://doi.org/10.1016/j.ijpe.2022.108579 doi: 10.1016/j.ijpe.2022.108579
    [69] N. Zaerpour, R. De Koster, Y. Yu, Storage policies and optimal shape of a storage system, Int. J. Prod. Res., 51 (2013). https://doi.org/10.1080/00207543.2013.774502 doi: 10.1080/00207543.2013.774502
    [70] D. Sun, Y. Meng, L. Tang, J. Liu, B. Huang, J. Yang, Storage space allocation problem at inland bulk material stockyard, Transp. Res. Part E Logist. Transp. Rev., 134 (2020), 101856. https://doi.org/10.1016/j.tre.2020.101856 doi: 10.1016/j.tre.2020.101856
    [71] Y. Wooyeon, Operational strategies for cross docking systems, Phd Thesis, Iowa State University, Ames, Iowa, 2002. https://doi.org/10.31274/rtd-180813-11026
  • Reader Comments
  • © 2023 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(3181) PDF downloads(191) Cited by(8)

Figures and Tables

Figures(4)  /  Tables(3)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog